Ladislav Lukšan Ústav informatiky Praha 8 Telefon: (+4202) , Fax: (+4202) luksan@cs.cas.cz
|
|
- Helen Sara Scott
- 8 years ago
- Views:
Transcription
1 Přehled Publikační činnosti Ladislav Lukšan Ústav informatiky Akademie věd České republiky Pod vodárenskou věží Praha 8 Telefon: (+4202) , Fax: (+4202) luksan@cs.cas.cz Seznam publikací: 1. Lukšan L.: New Combined Method for Unconstrained Minimization. Computing, Vol.28, 1982, pp Lukšan L.: Quasi-Newton Methods without Projections for Unconstrained Minimization. Kybernetika, Vol.18, 1982, No.4, pp Lukšan L.: Quasi-Newton Methods without Projections for Linearly Constrained Minimization. Kybernetika, Vol.18, 1982, No.4, pp Lukšan L.: Variable Metric Method with Limited Storage for Large Scale Unconstrained Minimization. Kybernetika, Vol.18, 1982, No.6, pp Lukšan L.: Variable Metric Methods for Linearly Constrained Nonlinear Minimax Approximation. Computing, Vol.30, 1983, pp Lukšan L.: Dual Method for Solving a Special Problem of Quadratic Programming as a Subproblem at Linearly Constrained Nonlinear Minimax Approximation. Kybernetika 20 (1984) Lukšan L.: A Compact Variable Metric Algorithm for Linearly Constrained Nonlinear Minimax Approximation. Kybernetika, Vol.21, 1985, No.6, pp Lukšan L.: An Implementation of Recursive Quadratic Programming Variable Metric Methods for Linearly Constrained Nonlinear Minimax Approximation. Kybernetika, Vol.21, 1985, No.1, pp Lukšan L.: Variable Metric Methods for a Class of Extended Conic Functions. Kybernetika, Vol.21, 1985, No.2, pp Lukšan L.: A Compact Variable Metric Algorithm for Linear Minimax Approximation. Computing, Vol.36, 1986, pp Lukšan L.: Dual Method for Solving a Special Problem of Quadratic Programming as a Subproblem at Nonlinear Minimax Approximation. Applications of Mathematics, Vol. 31, 1986, pp Lukšan L.: Conjugate Direction Algorithms For Extended Conic Functions. Kybernetika, Vol.22, 1986, No.1, pp Lukšan L.: Conjugate Gradient Algorithms for Conic Functions. Applications of Mathematics, Vol.31, 1986, pp Lukšan L.: Metody s proměnnou metrikou. Nepodmíněná minimalizace. Academia, Praha Lukšan L.: Computational Experience with Improved Variable Metric Methods for Unconstrained Minimization. Kybernetika, Vol.26, 1990, No.5, pp Lukšan L.: A Note on Comparison of Statistical Software for Nonlinear Regression. Computational Statistics Quarterly, Vol.4, 1991, pp
2 17. Lukšan L.: Computational Experience with Improved Conjugate Gradient Methods for Unconstrained Minimization. Kybernetika, Vol.28, 1992, No.4, pp Lukšan L.: Variationally Derived Scaling and Variable Metric Updates from the Preconvex Part of the Broyden Family. Journal of Optimization Theory and Applications, Vol.73, 1992, No.2, pp Lukšan L.: Inexact Trust Region Method for Large Sparse Nonlinear Least Squares. Kybernetika, Vol.29, 1993, No.4, pp Lukšan L.: Inexact Trust Region Method for Large Sparse Systems of Nonlinear Equations. Journal of Optimization Theory and Applications, Vol.81, 1994, No. 3, pp Lukšan L.: Computational Experience With Known Variable Metric Updates. Journal of Optimization Theory and Applications, Vol.83, 1994, No.1, pp Lukšan L., Vlček J.: Parametrická optimalizace dynamických systémů. In: Programy a Algoritmy Numerické Matematiky 7, Bratříkov 1994, pp Lukšan L., Vlček J.: Simple Scaling for Variable Metric Updates. Technical Report V-611. Prague, ICS AS CR Lukšan L., Vlček J.: An Algorithm for Large Sparse Equality Constrained Nonlinear Programming Problems. Proceedings of the 11-th Summer School on Software and Algorithms of Numerical Mathematics. Železná Ruda, 1995, pp Lukšan L.: Efficient Trust Region Method for Nonlinear Least Squares. Kybernetika Vol. 32, 1996, pp Lukšan L.: Combined Trust Region Methods for Nonlinear Least Squares. Kybernetika Vol. 32, 1996, pp Lukšan L., Vlček J.: Optimization of Dynamical Systems. Kybernetika Vol. 32, 1996, pp Lukšan L.: Hybrid Methods for Large Sparse Nonlinear Least Squares. Journal of Optimization Theory and Applications, Vol. 89, 1996, pp Lukšan L., Vlček J.: Algoritmus pro řešení rozsáhlých řídkých ůloh nelineárního programování s omezeními ve tvaru rovností. In: Sborník přednášek letní školy Programy a Algoritmy Numerické Matematiky 8, Janov 1996, pp Lukšan L., Vlček J.: Svazková metoda druhého řádu pro nehladkou nepodmíněnou minimalizaci. In: Sborník přednášek letní školy Programy a Algoritmy Numerické Matematiky 8, Janov 1996, pp Lukšan L., Vlček J.: Globally Convergent Methods with Inexact Jacobians for Systems of Nonlinear Equations. Proceedings of the Prague Mathematical Conference Prague, July 8-12, 1996, pp Lukšan L., Vlček J.: A Bundle-Newton Method for Nonsmooth Unconstrained Minimization. Proceedings of the Prague Mathematical Conference Prague, July 8-12, 1996, pp Lukšan L., Vlček J.: Truncated Trust Region Methods Based on Preconditioned Iterative Subalgorithms for Large Sparse Systems of Nonlinear Equations. Journal of Optimization Theory and Applications, Vol. 95, 1997, No. 3. pp Lukšan L.: Numerical methods for unconstrained optimization. Technical Report DMSIA 97/12, Universita degli Studi di Bergamo, Lukšan L., Vlček J.: Computational Experience with Globally Convergent Descent Methods for Large Sparse Systems of Nonlinear Equations. Optimization Methods and Software, Vol. 8, 1998, pp
3 36. Lukšan L., Vlček J.: Indefinitely Preconditioned Inexact Newton Method for Large Sparse Equality Constrained Nonlinear Programming Problems. Numerical Linear Algebra with Applications, Vol. 5, 1998, pp Lukšan L., Vlček J.: A Bundle-Newton Method for Nonsmooth Unconstrained Minimization. Mathematical Programming, Vol. 83, 1998, pp Lukšan L., Vlček J.: Indefinitní předpodmínění KKT systémů. In: Programy a Algoritmy Numerické Matematiky 9, Kořenov 1998, pp Lukšan L., Vlček J.: Užití metod s proměnnou metrikou pro nehladkou minimalizaci. In: Programy a Algoritmy Numerické Matematiky 9 Kořenov, 1998, pp Lukšan L., Spedicato E.: Variable metric methods for unconstrained optimization. Technical Report DMSIA 98/7, Universita degli Studi di Bergamo, Lukšan L., Vlček J.: Sparse and Partially Separable Test Problems for Unconstrained and Equality Constrained Optimization. Technical Report V-767. Prague, ICS AS CR Makela M.M., Miettinen M., Lukšan L., Vlček J.: Nonsmooth Optimization Methods Applied to Hemivariational Inequalities. Journal of Global Optimization, Vol.14, 1999, pp Lukšan L., Vlček J.: Globally convergent variable metric method for convex nonsmooth unconstrained minimization. Journal of Optimization Theory and Applications Vol.102, 1999, pp Lukšan L., Vlček J.: Conjugate gradient methods for saddle point systems. In: Proceedings of the 13-th Summer School on Software and Algorithms of Numerical Mathematics. Nečtiny, 1999, pp Vlček J., Lukšan L.: Variable metric method for nonconvex nonsmooth unconstrained minimization. In: Proceedings of the 13-th Summer School on Software and Algorithms of Numerical Mathematics. Nečtiny, 1999, pp Lukšan L., Spedicato E.: Variable metric methods for unconstrained optimization and nonlinear least squares. Journal of Computational and Applied Mathematics 124 (2000) Lukšan L., Vlček J.: Test problems for nonsmooth unconstrained and linearly constrained optimization. Technical Report V-798. Prague, ICS AS CR Lukšan L., Vlček J.: Základy nehladké analýzy. Teorie a algoritmy. Technical Report V-808. Prague, ICS AS CR, Lukšan L., Vlček J.: Introduction to nonsmooth analysis. Theory and algorithms. Technical Report DMSIA 00/1 (serie didattica), Universita degli Studi di Bergamo, Lukšan L., Spedicato E.: A globally convergent nonlinear ABS algorithm. Technical Report DMSIA 00/3, Universita degli Studi di Bergamo, Lukšan L., Vlček J.: Metoda vnitřních bodů pro nelineární nekonvexní optimalizaci. In: Sborník přednášek letní školy Programy a Algoritmy Numerické Matematiky 10, Libverda, Lukšan L., Vlček J.: Metoda redukovaných Hessiánů pro nehladkou nepodmíněnou minimalizaci. In: Sborník přednášek letní školy Programy a Algoritmy Numerické Matematiky 10, Libverda, Bodon E., Lukšan L., Spedicato E.: Computational experiments with linear ABS algorithms. Technical Report v-819. Prague, ICS AS CR, Bodon E., Del Popolo A., Lukšan L., Spedicato E.: Computational experiments with ABS algorithms for overdetermined linear systems. Technical Report DMSIA 00/19, Universita degli Studi di Bergamo, Bodon E., Del Popolo A., Lukšan L., Spedicato E.: Computational experiments with ABS algorithms for KKT linear systems. Technical Report DMSIA 00/20, Universita degli Studi di Bergamo, 2000.
4 56. Bodon E., Lukšan L., Spedicato E.: Computational experiments with ABS algorithms for determined and underdetermined linear systems. Technical Report DMSIA 00/21, Universita degli Studi di Bergamo, Lukšan L., Vlček J.: Preconditioning of saddle-point systems. In: Proceedings of the conference SIMONA 2000, Liberec Bodon E., Del Popolo A., Lukšan L., Spedicato E.: Numerical performance of ABS codes for systems of nonlinear equations. Technical Report DMSIA 01/01, Universita degli Studi di Bergamo, Lukšan L., Vlček J.: Algorithm 811: NDA: Algorithms for nondifferentiable optimization. ACM Transactions on Mathematical Software, Vol.27, 2001, pp Vlček J., Lukšan L.: Globally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization. Journal of Optimization Theory and Applications, Vol.111, 2001, pp Bodon E., Del Popolo A., Lukšan L., Spedicato E.: Computational experiments with ABS algorithms for KKT linear systems. Optimization Methods and Software, Vol.16, 2001, pp Lukšan L., Vlček J.: Numerical experience with iterative methods for equality constrained nonlinear programming problems. Optimization Methods and Software, Vol.16, 2001, pp Lukšan L., Vlček J.: Nonsmooth equation method for general nonlinear programming. Proceedings of the Summer School Software and Algorithms of Numerical Mathematics, SANM Kvilda, 8-12 September Bodon E., Lukšan L., Spedicato E.: Computational experiments with conjugate type ABS algorithms. Technical Report DMSIA 01/26, Universita degli Studi di Bergamo, Bodon E., Lukšan L., Spedicato E.: Numerical performance of ABS codes for nonlinear least squares. Technical Report DMSIA 01/27, Universita degli Studi di Bergamo, Lukšan L., Vlček J.: Řešení rozsáhlých řídkých úloh nelineárního programování. In: Sborník přednášek letní školy Programy a Algoritmy Numerické Matematiky 10, Maxov, Vlček J., Lukšan L.: New variable metric methods for unconstrained minimization covering the largescale case. Technical Report v-876. Prague, ICS AS CR, Lukšan L., Vlček J.: Programový systém pro univerzální funkcionální optimalizaci. Sborník konference Aplikace numerických metod v problematice podzemního skladování zemního plynu a v ložiskovém inenýrství. Lázně Libverda, dubna Lukšan L., Vlček J.: Variable metric methods for nonsmooth optimization. In: Numerical Linear Algebra and Optimization (Ya-xiang Yuan ed.), Science Press, Beijing (2003) Lukšan L., Matonoha C., Vlček J.: Interior point methods for large-scale nonlinear programming. Proceedings of the Summer School Numerical Methods for Local and Global Optimization: Sequential and Parallel Algorithms. Cortona, July, Lukšan L., Vlček J.: Discrete minimax approximation with application to filter design. Proceedings of the 2-nd International Workshop on Simulation, Modelling and Numerical Analysis, SIMONA Liberec, 1-3 September Lukšan L., Vlček J.: Shifted variable metric methods for unconstrained optimization. Proceedings of the Summer School Software and Algorithms of Numerical Mathematics, SANM Hejnice, 8-12 September Vlček J., Lukšan L.: New limited variable metric methods for unconstrained optimization. Proceedings of the Summer School Software and Algorithms of Numerical Mathematics, SANM Hejnice, 8-12 September Lukšan L., Vlček J.: Test Problems for Unconstrained Optimization. Technical Report v-897. Prague, ICS AS CR, 2003.
5 75. Lukšan L., Vlček J.: Nonsmooth equation method for nonlinear nonconvex optimization. In: Conjugate Gradient Algorithms and Finite Element Methods (M.Křížek, P.Neittaanmäki, R.Glovinski, S.Korotov eds.). Springer Verlag, Berlin (2004) Lukšan L., Matonoha C., Vlček J.: Interior point method for nonlinear nonconvex optimization. Numerical Linear Algebra with Applications 11 (2004) Vlček J., Lukšan L.: Additional properties of shifted variable metric methods. Technical Report v-899. Prague, ICS AS CR, Lukšan L., Vlček J.: Software system for universal functional optimization. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM Hotel Maxov, 6-11 June Vlček J., Lukšan L.: Variationally-derived limited-memory methods for unconstrained optimization. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM Hotel Maxov, 6-11 June Lukšan L., Matonoha C., Vlček J.: A shifted Steihaug-Toint method for computing trust-region step. Technical Report V-914. Prague, ICS AS CR, Lukšan L., Vlček J.: Variable Metric Method for Minimization of Partially Separable Nonsmooth Functions. Technical Report V-916. Prague, ICS AS CR Lukšan L., Rozložník M., Tůma M.: Programy pro řešení rovnic chemické rovnováhy. Technical Report V-954. Prague, ICS AS CR Lukšan L., Stuchlý J., Vlček J.: Trust-region interior point method for large sparse inequality constrained optimization. Technical Report V-956, Prague, ICS AS CR, Lukšan L., Matonoha C., Vlček J.: Interior point methods for large-scale nonlinear programming. Optimization Methods and software 20 (2005) Lukšan L., Vlček J.: Variable metric method for a class of large-scale nonsmooth functions. Proceedings of the Summer School Software and Algorithms of Numerical Mathematics, SANM Srni, September Vlček J., Lukšan L.: Shifted limited-memory variable metric methods for large-scale unconstrained minimization. J. of Computational and Applied Mathematics, 186 (2006) Lukšan L., Vlček J.: Variable metric method for minimization of partially separable nonsmooth functions. Pacific Journal on Optimization 2 (2006). 88. Lukšan L., Vlček J.: Efficient methods for large-scale unconstrained optimization. In: Large-scale Nonlinear Optimization (G. Di Pillo and M. Roma, Eds.), Kluwer (2006) Lukšan L., Matonoha C., Vlček J.: Interior-point method for large-scale minimax optimization. Proceedings of the Seminar Numerical Analysis. Moninec, January Lukšan L., Matonoha C., Vlček J.: A Shifted Steihaug-Toint Method for Computing a Trust-Region Step. Proceedings of the Seminar Numerical Analysis. Moninec, January Lukšan L., Matonoha C., Vlček J.: Interior-point method for large-scale l 1 optimization. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM Prague, May Lukšan L., Matonoha C., Vlček J.: Interior-point methods for minimization of composite nonsmooth functions. Proceedings of the Seminar Applied Mathematics SAMO 06. Ostravice, September Vlček J., Lukšan L.: New class of limited-memory variationally-derived variable metric methods. Technical Report V-973. Prague, ICS AS CR 2006.
6 94. Lukšan L., Matonoha C., Vlček J.: Interior Point Methods for Minimization of Composite Nonsmooth Functions. Technical Report V-987. Prague, ICS AS CR Lukšan L., Rozložník M., Tůma M.: Programy pro řešení rovnic chemické kinetiky. Technical Report V-988. Prague, ICS AS CR Lukšan L., Matonoha C., Vlček J.: Trust-region interior-point method for large sparse l 1 optimization. Optimization Methods and Software 22 (2007) Lukšan L., Hartman J., Zítko J.: Automatic differentiation and its program realization. Technical Report V-992. Prague, ICS AS CR Lukšan L., Rozložník M., Tůma M. Vlček J.: Optimalizační programy vyvinuté pro řešení úloh chemické rovnováhy a chemické kinetiky. Technical Report TANDEM FT-TA/066. Prague Lukšan L., Matonoha C., Vlček J.: New Subroutines for Large-Scale Optimization. Technical Report V-999. Prague, ICS AS CR Lukšan L., Matonoha C., Vlček J.: Subroutines for Large-Scale Nonlinear Programming. Technical Report V Prague, ICS AS CR Lukšan L., Hartman J.: Implementace automatického derivování v systému UFO. Technical Report V Prague, ICS AS CR Lukšan L., Matonoha C., Vlček J.: Primal interior point method for minimization of generalized minimax functions. Technical Report V Prague, ICS AS CR Vlček J., Lukšan L.: New class of limited-memory variationally-derived variable metric methods. Presented at the GAMM International Workshop Computational Methods with Applications, Harrachov, August 19 25, Lukšan L., Matonoha C., Vlček J.: Trust-region interior point method for large sparse l 1 optimization. Presented at the GAMM International Workshop Computational Methods with Applications, Harrachov, August 19 25, Lukšan L., Matonoha C., Vlček J.: Trust-region interior point methods for large sparse optimization. Presented at the IMA International Conference Numerical Linear Algebra and Optimization, Birmingham, September 13 15, Lukšan L., Matonoha C., Vlček J.: Konvergence nelineární metody sdružených gradientů. Proceedings of the Seminar of Numerical Analysis SNA 08, Liberec, January Lukšan L., Matonoha C., Vlček J.: On Lagrange multipliers of trust-region subproblems. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM Hotel Maxov, 1-6 June Lukšan L., Matonoha C., Vlček J.: Primal interior point method for generalized minimax functions. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM Hotel Maxov, 1-6 June Vlček J., Lukšan L.: Limited-memory variable metric methods based on invariant matrices. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM Hotel Maxov, 1-6 June Lukšan L., Matonoha C., Vlček J.: Metody vnitřních bodů pro nekonvexní úlohy nelineárního programování. Sborník sedmého matematického workshopu. Brno, October Lukšan L., Matonoha C., Vlček J.: On Lagrange multipliers of trust-region subproblems. BIT Numerical Analysis 48 (2008) Matonoha C., Lukšan L., Vlček J.: Interior-point method for nonlinear nonconvex optimization. Presented on 8-th GAMM Workshop, Hamburg, September 2008.
7 113. Matonoha C., Lukšan L., Vlček J.: On Lagrange multipliers of trust-region subproblems. Presented on Applied Linear Algebra in Honor of Ivo Marek conference, Novi Sad, April Vlček J., Lukšan L.: Limited-memory projective variable metric methods for unconstrained minimization. Report V Prague, ICS AS CR Vlček J., Lukšan L.: Transformations enabling to construct limited-memory Broyden class methods. Report V Prague, ICS AS CR Lukšan L., Matonoha C., Vlček J.: Computational experience with modified conjugate gradient methods for unconstrained optimization. Report V-1038, Prague, ICS AS CR Lukšan L., Matonoha C., Vlček J.: Interior point method for nonlinear programming with complementarity constraints. Report V-1039, Prague, ICS AS CR Lukšan L.: Matematické programování. Report V Prague, ICS AS CR Lukšan L., Matonoha C., Vlček J.: Computational experience with modified conjugate gradient methods for unconstrained optimization. Proceedings of the Seminar of Numerical Analysis SNA 09, Ostrava, January Lukšan L., Matonoha C., Vlček J.: Interior point method for nonlinear programming with complementarity constraints. Modelling 2009, Rožnov pod Radhoštěm, June Lukšan L., Matonoha C., Vlček J.: Interior-point Method for Nonlinear Nonconvex Optimization. Modelling 2009, Rožnov pod Radhoštěm, June Vlček J., Lukšan L.: Transformations enabling to construct limited-memory Broyden class methods. Modelling 2009, Rožnov pod Radhoštěm, June Lukšan L., Matonoha C., Vlček J.: Primal interior-point method for large sparse minimax optimization. Kybernetika 45 (2009) Hartman J., Lukšan L., Zítko J.: Automatic differentiation and its program realization. Kybernetika 45 (2009) Lukšan L., Matonoha C., Vlček J.: Algorithm 896: LSA: Algorithms for Large-Scale Optimization. ACM Transactions on Mathematical Software 36 (2009) 16:1-16: Lukšan L., Vlček J.: Recursive formulation of limited memory variable metric methods. Proceedings of the Seminar of Numerical Analysis SNA 10, Nové Hrady, January Lukšan L., Matonoha C., Vlček J.: Primal interior point method for minimization of generalized minimax functions. Kybernetika 46 (2010) Lukšan L., Matonoha C., Vlček J.: Sparse test problems for unconstrained optimization. Technical Report V Prague, ICS AS CR Lukšan L., Matonoha C., Vlček J.: Band preconditioners for the matrix free truncated Newton method. Technical Report V Prague, ICS AS CR Královcová J., Lukšan L., Mlýnek J.: Exposure optimization for warming of shapes in the automotive industry. Technical Report V Prague, ICS AS CR Lukšan L., Matonoha C., Vlček J.: Modified CUTE Problems for Sparse Unconstrained Optimization. Technical Report V Prague, ICS AS CR Lukšan L., Matonoha C., Vlček J.: Robust preconditioners for the matrix free truncated Newton method. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM Hotel Maxov, 6-11 June Vlček J., Lukšan L.: Limited-memory variable metric methods that use quantities from the precedings iterations. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM Hotel Maxov, 6-11 June 2010.
8 134. Matonoha C., Lukšan L., Vlček J.: Interior-point method for nonlinear programming with complementarity constraints. IMA 2010 Conference, Birmingham, September Lukšan L., Matonoha C., Vlček J.: UFO Software system for universal functional optimization. Presented on the Seminar of Numerical Analysis SNA 11, Rožnov pod Radhoštěm, January Lukšan L., Matonoha C., Vlček J.: Interior-Point Method for Nonlinear Programming with Complementarity Constraints. Presented on the SIAM Conference on Optimization, Darmstadt, May Lukšan L., Vlček J.: Recursive formulation of limited memory variable metric methods. Presented on the SIAM Conference on Optimization, Darmstadt, May Vlček J., Lukšan L.: Modifications of the limited-memory BNS method for better satisfaction of previous quasi-newton conditions. Technical Report V Prague, ICS AS CR Lukšan L.: Numerické optimalizační metody. Technical Report V Prague, ICS AS CR, Královcová J., Lukšan L., Mlýnek J.: Exposure optimization for warming the shapes in the automotive industry. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM Hotel Maxov, 3-8 June Vlček J., Lukšan L.: Modifications of the limited-memory BFGS method based on the idea of conjugate directions. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM Hotel Maxov, 3-8 June Vlček J., Lukšan L.: A conjugate directions approach to improve the limited-memory BFGS method. Applied Mathematics and Computation 219 (2012) Vlček J., Lukšan L.: Generalizations of the limited-memory BFGS method based on quasi-product form of update. Computational and Applied Mathematics Journal of Computational and Applied Mathematics 241 (2013) Lukšan L., Vlček J.: Recursive form of general limited memory variable metric methods. Kybernetika 49 (2013) Lukšan L., Vlček J.: Efficient tridiagonal preconditioner for the matrix-free truncated Newton method. SNA 14, Nymburk, January Lukšan L., Vlček J.: Efficient tridiagonal preconditioner for the matrix-free truncated Newton method. Applied Mathematics and Computation 235 (2014) Lukšan L., Vlček J.: Nonlinear conjugate gradient methods. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM Hotel Maxov, 8-13 June Vlček J., Lukšan L.: A modified limited-memory BNS method for unconstrained minimization derived from the conjugate directions idea. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM Hotel Maxov, 8-13 June Lukšan L., Tůma M., Vlček J., Ramešová N., Šiška M., Hartman J., Matonoha C.: UFO Interactive System for Universal Functional Optimization. Technical Report V Prague, ICS AS CR Lukšan L., Vlček J.: On variable metric methods for unconstrained minimization. SNA 15, Ostrava, January Vlček J., Lukšan L.: A modified limited-memory BNS method for unconstrained minimization based on the conjugate directions idea. Optimization Methods and Software 30 (2015)
(Quasi-)Newton methods
(Quasi-)Newton methods 1 Introduction 1.1 Newton method Newton method is a method to find the zeros of a differentiable non-linear function g, x such that g(x) = 0, where g : R n R n. Given a starting
More informationNonlinear Optimization: Algorithms 3: Interior-point methods
Nonlinear Optimization: Algorithms 3: Interior-point methods INSEAD, Spring 2006 Jean-Philippe Vert Ecole des Mines de Paris Jean-Philippe.Vert@mines.org Nonlinear optimization c 2006 Jean-Philippe Vert,
More informationAN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS
AN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS Revised Edition James Epperson Mathematical Reviews BICENTENNIAL 0, 1 8 0 7 z ewiley wu 2007 r71 BICENTENNIAL WILEY-INTERSCIENCE A John Wiley & Sons, Inc.,
More informationBig Data - Lecture 1 Optimization reminders
Big Data - Lecture 1 Optimization reminders S. Gadat Toulouse, Octobre 2014 Big Data - Lecture 1 Optimization reminders S. Gadat Toulouse, Octobre 2014 Schedule Introduction Major issues Examples Mathematics
More informationLARGE SCALE NONLINEAR OPTIMIZATION
Ettore Majorana Centre for Scientific Culture International School of Mathematics G. Stampacchia Erice, Italy 40th Workshop LARGE SCALE NONLINEAR OPTIMIZATION 22 June 1 July 2004. List of invited and contributed
More informationLimited Memory Solution of Complementarity Problems arising in Video Games
Laboratoire d Arithmétique, Calcul formel et d Optimisation UMR CNRS 69 Limited Memory Solution of Complementarity Problems arising in Video Games Michael C. Ferris Andrew J. Wathen Paul Armand Rapport
More informationDual Methods for Total Variation-Based Image Restoration
Dual Methods for Total Variation-Based Image Restoration Jamylle Carter Institute for Mathematics and its Applications University of Minnesota, Twin Cities Ph.D. (Mathematics), UCLA, 2001 Advisor: Tony
More informationINTERIOR-POINT METHODS FOR NONCONVEX NONLINEAR PROGRAMMING: FILTER METHODS AND MERIT FUNCTIONS
INTERIOR-POINT METHODS FOR NONCONVEX NONLINEAR PROGRAMMING: FILTER METHODS AND MERIT FUNCTIONS HANDE Y. BENSON, DAVID F. SHANNO, AND ROBERT J. VANDERBEI Operations Research and Financial Engineering Princeton
More informationAn Overview Of Software For Convex Optimization. Brian Borchers Department of Mathematics New Mexico Tech Socorro, NM 87801 borchers@nmt.
An Overview Of Software For Convex Optimization Brian Borchers Department of Mathematics New Mexico Tech Socorro, NM 87801 borchers@nmt.edu In fact, the great watershed in optimization isn t between linearity
More informationWhy is SAS/OR important? For whom is SAS/OR designed?
Fact Sheet What does SAS/OR software do? SAS/OR software provides a powerful array of optimization, simulation and project scheduling techniques to identify the actions that will produce the best results,
More information2014-2015 The Master s Degree with Thesis Course Descriptions in Industrial Engineering
2014-2015 The Master s Degree with Thesis Course Descriptions in Industrial Engineering Compulsory Courses IENG540 Optimization Models and Algorithms In the course important deterministic optimization
More informationNumerisches Rechnen. (für Informatiker) M. Grepl J. Berger & J.T. Frings. Institut für Geometrie und Praktische Mathematik RWTH Aachen
(für Informatiker) M. Grepl J. Berger & J.T. Frings Institut für Geometrie und Praktische Mathematik RWTH Aachen Wintersemester 2010/11 Problem Statement Unconstrained Optimality Conditions Constrained
More information10. Proximal point method
L. Vandenberghe EE236C Spring 2013-14) 10. Proximal point method proximal point method augmented Lagrangian method Moreau-Yosida smoothing 10-1 Proximal point method a conceptual algorithm for minimizing
More informationOpen-source Quality Assurance and Performance Analysis Tools
Open-source Quality Assurance and Performance Analysis Tools Armin Pruessner, Michael Bussieck, Steven Dirkse, Stefan Vigerske GAMS Development Corporation 1217 Potomac Street NW Washington, DC 20007 1
More informationAn interval linear programming contractor
An interval linear programming contractor Introduction Milan Hladík Abstract. We consider linear programming with interval data. One of the most challenging problems in this topic is to determine or tight
More informationTOMLAB - For fast and robust largescale optimization in MATLAB
The TOMLAB Optimization Environment is a powerful optimization and modeling package for solving applied optimization problems in MATLAB. TOMLAB provides a wide range of features, tools and services for
More informationMathematics (MAT) MAT 061 Basic Euclidean Geometry 3 Hours. MAT 051 Pre-Algebra 4 Hours
MAT 051 Pre-Algebra Mathematics (MAT) MAT 051 is designed as a review of the basic operations of arithmetic and an introduction to algebra. The student must earn a grade of C or in order to enroll in MAT
More informationInterior Point Methods and Linear Programming
Interior Point Methods and Linear Programming Robert Robere University of Toronto December 13, 2012 Abstract The linear programming problem is usually solved through the use of one of two algorithms: either
More informationMaster Specialization in Digital Design: Design and Programming of Embedded Systems
Master Specialization in Digital Design: Design and Programming of Embedded Systems Jan Schmidt, Ph.D. Department of Digital Design Faculty of Information Technology Czech Technical University in Prague
More informationInternational Journal of Software and Web Sciences (IJSWS) www.iasir.net
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) ISSN (Print): 2279-0063 ISSN (Online): 2279-0071 International
More informationOptimization Theory for Large Systems
Optimization Theory for Large Systems LEON S. LASDON CASE WESTERN RESERVE UNIVERSITY THE MACMILLAN COMPANY COLLIER-MACMILLAN LIMITED, LONDON Contents 1. Linear and Nonlinear Programming 1 1.1 Unconstrained
More informationIncreasing for all. Convex for all. ( ) Increasing for all (remember that the log function is only defined for ). ( ) Concave for all.
1. Differentiation The first derivative of a function measures by how much changes in reaction to an infinitesimal shift in its argument. The largest the derivative (in absolute value), the faster is evolving.
More informationSOLVING LINEAR SYSTEMS
SOLVING LINEAR SYSTEMS Linear systems Ax = b occur widely in applied mathematics They occur as direct formulations of real world problems; but more often, they occur as a part of the numerical analysis
More informationBig Data Optimization at SAS
Big Data Optimization at SAS Imre Pólik et al. SAS Institute Cary, NC, USA Edinburgh, 2013 Outline 1 Optimization at SAS 2 Big Data Optimization at SAS The SAS HPA architecture Support vector machines
More informationA NEW LOOK AT CONVEX ANALYSIS AND OPTIMIZATION
1 A NEW LOOK AT CONVEX ANALYSIS AND OPTIMIZATION Dimitri Bertsekas M.I.T. FEBRUARY 2003 2 OUTLINE Convexity issues in optimization Historical remarks Our treatment of the subject Three unifying lines of
More informationComputing a Nearest Correlation Matrix with Factor Structure
Computing a Nearest Correlation Matrix with Factor Structure Nick Higham School of Mathematics The University of Manchester higham@ma.man.ac.uk http://www.ma.man.ac.uk/~higham/ Joint work with Rüdiger
More informationNumerical Analysis Introduction. Student Audience. Prerequisites. Technology.
Numerical Analysis Douglas Faires, Youngstown State University, (Chair, 2012-2013) Elizabeth Yanik, Emporia State University, (Chair, 2013-2015) Graeme Fairweather, Executive Editor, Mathematical Reviews,
More informationA Simultaneous Solution for General Linear Equations on a Ring or Hierarchical Cluster
Acta Technica Jaurinensis Vol. 3. No. 1. 010 A Simultaneous Solution for General Linear Equations on a Ring or Hierarchical Cluster G. Molnárka, N. Varjasi Széchenyi István University Győr, Hungary, H-906
More informationPARAMETER IDENTIFICATION ARISING IN OPTION PRICING MODELS AND NEURAL NETWORKS FOR UNDERDETERMINED SYSTEMS. Dissertation MICHAELA SCHULZE
PARAMETER IDENTIFICATION FOR UNDERDETERMINED SYSTEMS ARISING IN OPTION PRICING MODELS AND NEURAL NETWORKS Dissertation zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften Dem Fachbereich
More information[1] F. Jarre and J. Stoer, Optimierung, Lehrbuch, Springer Verlag 2003.
References Lehrbuch: [1] F. Jarre and J. Stoer, Optimierung, Lehrbuch, Springer Verlag 2003. Referierte Zeitschriftenbeiträge: [2] F. Jarre, On the Convergence of the Method of Analytic Centers when applied
More informationPART 1: INSTRUCTOR INFORMATION, COURSE DESCRIPTION AND TEACHING METHODS
PART 1: INSTRUCTOR INFORMATION, COURSE DESCRIPTION AND TEACHING METHODS 1.1 General information Full course title: Quantitative Methods in Economics Type of course: Compulsory Level of course B.A. Year
More informationStochastic Gradient Method: Applications
Stochastic Gradient Method: Applications February 03, 2015 P. Carpentier Master MMMEF Cours MNOS 2014-2015 114 / 267 Lecture Outline 1 Two Elementary Exercices on the Stochastic Gradient Two-Stage Recourse
More informationNumerical Methods I Solving Linear Systems: Sparse Matrices, Iterative Methods and Non-Square Systems
Numerical Methods I Solving Linear Systems: Sparse Matrices, Iterative Methods and Non-Square Systems Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course G63.2010.001 / G22.2420-001,
More informationSummer course on Convex Optimization. Fifth Lecture Interior-Point Methods (1) Michel Baes, K.U.Leuven Bharath Rangarajan, U.
Summer course on Convex Optimization Fifth Lecture Interior-Point Methods (1) Michel Baes, K.U.Leuven Bharath Rangarajan, U.Minnesota Interior-Point Methods: the rebirth of an old idea Suppose that f is
More informationA matrix-free preconditioner for sparse symmetric positive definite systems and least square problems
A matrix-free preconditioner for sparse symmetric positive definite systems and least square problems Stefania Bellavia Dipartimento di Ingegneria Industriale Università degli Studi di Firenze Joint work
More informationInterior-Point Algorithms for Quadratic Programming
Interior-Point Algorithms for Quadratic Programming Thomas Reslow Krüth Kongens Lyngby 2008 IMM-M.Sc-2008-19 Technical University of Denmark Informatics and Mathematical Modelling Building 321, DK-2800
More informationSolving polynomial least squares problems via semidefinite programming relaxations
Solving polynomial least squares problems via semidefinite programming relaxations Sunyoung Kim and Masakazu Kojima August 2007, revised in November, 2007 Abstract. A polynomial optimization problem whose
More informationA Perfect Example for The BFGS Method
A Perfect Example for The BFGS Method Yu-Hong Dai Abstract Consider the BFGS quasi-newton method applied to a general nonconvex function that has continuous second derivatives. This paper aims to construct
More informationMachine learning and optimization for massive data
Machine learning and optimization for massive data Francis Bach INRIA - Ecole Normale Supérieure, Paris, France ÉCOLE NORMALE SUPÉRIEURE Joint work with Eric Moulines - IHES, May 2015 Big data revolution?
More informationMATHEMATICS (MATH) 3. Provides experiences that enable graduates to find employment in sciencerelated
194 / Department of Natural Sciences and Mathematics MATHEMATICS (MATH) The Mathematics Program: 1. Provides challenging experiences in Mathematics, Physics, and Physical Science, which prepare graduates
More informationNonlinear Programming Methods.S2 Quadratic Programming
Nonlinear Programming Methods.S2 Quadratic Programming Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard A linearly constrained optimization problem with a quadratic objective
More informationModel order reduction via Proper Orthogonal Decomposition
Model order reduction via Proper Orthogonal Decomposition Reduced Basis Summer School 2015 Martin Gubisch University of Konstanz September 17, 2015 Martin Gubisch (University of Konstanz) Model order reduction
More informationSequence of Mathematics Courses
Sequence of ematics Courses Where do I begin? Associates Degree and Non-transferable Courses (For math course below pre-algebra, see the Learning Skills section of the catalog) MATH M09 PRE-ALGEBRA 3 UNITS
More informationP013 INTRODUCING A NEW GENERATION OF RESERVOIR SIMULATION SOFTWARE
1 P013 INTRODUCING A NEW GENERATION OF RESERVOIR SIMULATION SOFTWARE JEAN-MARC GRATIEN, JEAN-FRANÇOIS MAGRAS, PHILIPPE QUANDALLE, OLIVIER RICOIS 1&4, av. Bois-Préau. 92852 Rueil Malmaison Cedex. France
More informationDomain Decomposition Methods. Partial Differential Equations
Domain Decomposition Methods for Partial Differential Equations ALFIO QUARTERONI Professor ofnumericalanalysis, Politecnico di Milano, Italy, and Ecole Polytechnique Federale de Lausanne, Switzerland ALBERTO
More informationList of Ph.D. Courses
Research Methods Courses (5 courses/15 hours) List of Ph.D. Courses The research methods set consists of five courses (15 hours) that discuss the process of research and key methodological issues encountered
More informationDepartment of Computer Science
113 Department of Computer Science Chairperson: Nasri, Ahmad H. Professor: Nasri, Ahmad H. Associate Professors: Attie, Paul C.; Karam, Marcel R.; Turkiyyah, George M. Assistant Professors: Abu Salem,
More informationOperations Research and Financial Engineering. Courses
Operations Research and Financial Engineering Courses ORF 504/FIN 504 Financial Econometrics Professor Jianqing Fan This course covers econometric and statistical methods as applied to finance. Topics
More informationOptimization Modeling for Mining Engineers
Optimization Modeling for Mining Engineers Alexandra M. Newman Division of Economics and Business Slide 1 Colorado School of Mines Seminar Outline Linear Programming Integer Linear Programming Slide 2
More informationAdvanced Computational Software
Advanced Computational Software Scientific Libraries: Part 2 Blue Waters Undergraduate Petascale Education Program May 29 June 10 2011 Outline Quick review Fancy Linear Algebra libraries - ScaLAPACK -PETSc
More informationOptimization Methods in Finance
Optimization Methods in Finance Gerard Cornuejols Reha Tütüncü Carnegie Mellon University, Pittsburgh, PA 15213 USA January 2006 2 Foreword Optimization models play an increasingly important role in financial
More informationSolving Very Large Financial Planning Problems on Blue Gene
U N I V E R S School of Mathematics T H E O I T Y H F G E D I N U R Solving Very Large Financial Planning Problems on lue Gene ndreas Grothey, University of Edinburgh joint work with Jacek Gondzio, Marco
More informationA Stochastic 3MG Algorithm with Application to 2D Filter Identification
A Stochastic 3MG Algorithm with Application to 2D Filter Identification Emilie Chouzenoux 1, Jean-Christophe Pesquet 1, and Anisia Florescu 2 1 Laboratoire d Informatique Gaspard Monge - CNRS Univ. Paris-Est,
More information350 Serra Mall, Stanford, CA 94305-9515
Meisam Razaviyayn Contact Information Room 260, Packard Building 350 Serra Mall, Stanford, CA 94305-9515 E-mail: meisamr@stanford.edu Research Interests Education Appointments Large scale data driven optimization
More informationNORTHWESTERN UNIVERSITY Department of Electrical Engineering and Computer Science LARGE SCALE UNCONSTRAINED OPTIMIZATION by Jorge Nocedal 1 June 23, 1996 ABSTRACT This paper reviews advances in Newton,
More informationCOMPUTATION OF THREE-DIMENSIONAL ELECTRIC FIELD PROBLEMS BY A BOUNDARY INTEGRAL METHOD AND ITS APPLICATION TO INSULATION DESIGN
PERIODICA POLYTECHNICA SER. EL. ENG. VOL. 38, NO. ~, PP. 381-393 (199~) COMPUTATION OF THREE-DIMENSIONAL ELECTRIC FIELD PROBLEMS BY A BOUNDARY INTEGRAL METHOD AND ITS APPLICATION TO INSULATION DESIGN H.
More informationComputational Optical Imaging - Optique Numerique. -- Deconvolution --
Computational Optical Imaging - Optique Numerique -- Deconvolution -- Winter 2014 Ivo Ihrke Deconvolution Ivo Ihrke Outline Deconvolution Theory example 1D deconvolution Fourier method Algebraic method
More information[1a] Bienstock D., Computational study of a family of mixed integer quadratic programming problems, Math. Programming 74 (1996), 121 140
6. Bibliografia 6.1. Riferimenti bibliografici [1a] Bienstock D., Computational study of a family of mixed integer quadratic programming problems, Math. Programming 74 (1996), 121 140 [2a] Chang T.J.,
More informationE-mail: frank.e.curtis@lehigh.edu
A. Biographical Information Home Address Curriculum Vitae Frank E. Curtis, Ph.D. Associate Professor Industrial and Systems Engineering Lehigh University http://coral.ie.lehigh.edu/ frankecurtis Business
More informationSimulation-based optimization methods for urban transportation problems. Carolina Osorio
Simulation-based optimization methods for urban transportation problems Carolina Osorio Civil and Environmental Engineering Department Massachusetts Institute of Technology (MIT) Joint work with: Prof.
More informationNumerical Analysis An Introduction
Walter Gautschi Numerical Analysis An Introduction 1997 Birkhauser Boston Basel Berlin CONTENTS PREFACE xi CHAPTER 0. PROLOGUE 1 0.1. Overview 1 0.2. Numerical analysis software 3 0.3. Textbooks and monographs
More informationModern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
More information9700 South Cass Avenue, Lemont, IL 60439 URL: www.mcs.anl.gov/ fulin
Fu Lin Contact information Education Work experience Research interests Mathematics and Computer Science Division Phone: (630) 252-0973 Argonne National Laboratory E-mail: fulin@mcs.anl.gov 9700 South
More informationMean value theorem, Taylors Theorem, Maxima and Minima.
MA 001 Preparatory Mathematics I. Complex numbers as ordered pairs. Argand s diagram. Triangle inequality. De Moivre s Theorem. Algebra: Quadratic equations and express-ions. Permutations and Combinations.
More informationBeyond stochastic gradient descent for large-scale machine learning
Beyond stochastic gradient descent for large-scale machine learning Francis Bach INRIA - Ecole Normale Supérieure, Paris, France Joint work with Eric Moulines, Nicolas Le Roux and Mark Schmidt - ECML-PKDD,
More informationP164 Tomographic Velocity Model Building Using Iterative Eigendecomposition
P164 Tomographic Velocity Model Building Using Iterative Eigendecomposition K. Osypov* (WesternGeco), D. Nichols (WesternGeco), M. Woodward (WesternGeco) & C.E. Yarman (WesternGeco) SUMMARY Tomographic
More informationParameter Estimation for Bingham Models
Dr. Volker Schulz, Dmitriy Logashenko Parameter Estimation for Bingham Models supported by BMBF Parameter Estimation for Bingham Models Industrial application of ceramic pastes Material laws for Bingham
More informationVariational approach to restore point-like and curve-like singularities in imaging
Variational approach to restore point-like and curve-like singularities in imaging Daniele Graziani joint work with Gilles Aubert and Laure Blanc-Féraud Roma 12/06/2012 Daniele Graziani (Roma) 12/06/2012
More informationNumerical Methods for Engineers
Steven C. Chapra Berger Chair in Computing and Engineering Tufts University RaymondP. Canale Professor Emeritus of Civil Engineering University of Michigan Numerical Methods for Engineers With Software
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationFleet Assignment Using Collective Intelligence
Fleet Assignment Using Collective Intelligence Nicolas E Antoine, Stefan R Bieniawski, and Ilan M Kroo Stanford University, Stanford, CA 94305 David H Wolpert NASA Ames Research Center, Moffett Field,
More informationCurrent Standard: Mathematical Concepts and Applications Shape, Space, and Measurement- Primary
Shape, Space, and Measurement- Primary A student shall apply concepts of shape, space, and measurement to solve problems involving two- and three-dimensional shapes by demonstrating an understanding of:
More informationMATH. ALGEBRA I HONORS 9 th Grade 12003200 ALGEBRA I HONORS
* Students who scored a Level 3 or above on the Florida Assessment Test Math Florida Standards (FSA-MAFS) are strongly encouraged to make Advanced Placement and/or dual enrollment courses their first choices
More informationApplied Computational Economics and Finance
Applied Computational Economics and Finance Mario J. Miranda and Paul L. Fackler The MIT Press Cambridge, Massachusetts London, England Preface xv 1 Introduction 1 1.1 Some Apparently Simple Questions
More informationSAS for the Department of Business Studies, ASB
SAS for the Department of Business Studies, ASB Kaare Brandt, Business Advisor, SAS Didde Pedersen, Academic Consultant, SAS Lars Søndergaard, Servicedesk Manager, ASB Lasse Skydstofte, Director, SAS Copyright
More informationHigh Performance Computing for Operation Research
High Performance Computing for Operation Research IEF - Paris Sud University claude.tadonki@u-psud.fr INRIA-Alchemy seminar, Thursday March 17 Research topics Fundamental Aspects of Algorithms and Complexity
More informationconstraint. Let us penalize ourselves for making the constraint too big. We end up with a
Chapter 4 Constrained Optimization 4.1 Equality Constraints (Lagrangians) Suppose we have a problem: Maximize 5, (x 1, 2) 2, 2(x 2, 1) 2 subject to x 1 +4x 2 =3 If we ignore the constraint, we get the
More informationA Simple Introduction to Support Vector Machines
A Simple Introduction to Support Vector Machines Martin Law Lecture for CSE 802 Department of Computer Science and Engineering Michigan State University Outline A brief history of SVM Large-margin linear
More informationarxiv:cs/0101001v1 [cs.ms] 3 Jan 2001
ARGONNE NATIONAL LABORATORY 9700 South Cass Avenue Argonne, Illinois 60439 arxiv:cs/0101001v1 [cs.ms] 3 Jan 2001 AUTOMATIC DIFFERENTIATION TOOLS IN OPTIMIZATION SOFTWARE Jorge J. Moré Mathematics and Computer
More informationOpenFOAM Optimization Tools
OpenFOAM Optimization Tools Henrik Rusche and Aleks Jemcov h.rusche@wikki-gmbh.de and a.jemcov@wikki.co.uk Wikki, Germany and United Kingdom OpenFOAM Optimization Tools p. 1 Agenda Objective Review optimisation
More informationAlgorithms for inverse big data problems
Algorithms for inverse big data problems Serge Gratton University of Toulouse CERFACS-IRIT Joint work with E. Bergou, S. Gurol, E. Simon, D. Titley-Peloquin, Ph.L. Toint, J. Tshimanga,L.N. Vicente, Z.
More informationGeneral Framework for an Iterative Solution of Ax b. Jacobi s Method
2.6 Iterative Solutions of Linear Systems 143 2.6 Iterative Solutions of Linear Systems Consistent linear systems in real life are solved in one of two ways: by direct calculation (using a matrix factorization,
More informationECONOMIC THEORY AND OPERATIONS ANALYSIS
WILLIAM J. BAUMOL Professor of Economics Princeton University ECONOMIC THEORY AND OPERATIONS ANALYSIS Second Edition Prentice-Hall, I Inc. Engkwood Cliffs, New Jersey CONTENTS PART 7 ANALYTIC TOOLS OF
More informationSeveral Views of Support Vector Machines
Several Views of Support Vector Machines Ryan M. Rifkin Honda Research Institute USA, Inc. Human Intention Understanding Group 2007 Tikhonov Regularization We are considering algorithms of the form min
More informationBookTOC.txt. 1. Functions, Graphs, and Models. Algebra Toolbox. Sets. The Real Numbers. Inequalities and Intervals on the Real Number Line
College Algebra in Context with Applications for the Managerial, Life, and Social Sciences, 3rd Edition Ronald J. Harshbarger, University of South Carolina - Beaufort Lisa S. Yocco, Georgia Southern University
More informationOptimization of Supply Chain Networks
Optimization of Supply Chain Networks M. Herty TU Kaiserslautern September 2006 (2006) 1 / 41 Contents 1 Supply Chain Modeling 2 Networks 3 Optimization Continuous optimal control problem Discrete optimal
More informationGraduate Certificate in Systems Engineering
Graduate Certificate in Systems Engineering Systems Engineering is a multi-disciplinary field that aims at integrating the engineering and management functions in the development and creation of a product,
More informationFurther Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1
Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing
More informationHANDE YURTTAN BENSON Curriculum Vitae
HANDE YURTTAN BENSON Curriculum Vitae Department of Decision Sciences Bennett S. LeBow College of Business Drexel University 3141 Chestnut Street Philadelphia, PA 19104-2875 (215) 895-6999 (215) 895-2907
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationAlgorithmic Research and Software Development for an Industrial Strength Sparse Matrix Library for Parallel Computers
The Boeing Company P.O.Box3707,MC7L-21 Seattle, WA 98124-2207 Final Technical Report February 1999 Document D6-82405 Copyright 1999 The Boeing Company All Rights Reserved Algorithmic Research and Software
More informationTrust Region Newton Method for Large-Scale Logistic Regression
Journal of Machine Learning Research 9 (2008) 627-650 Submitted 4/07; Revised 12/07; Published 4/08 Trust Region Newton Method for Large-Scale Logistic Regression Chih-Jen Lin Department of Computer Science
More informationHPC enabling of OpenFOAM R for CFD applications
HPC enabling of OpenFOAM R for CFD applications Towards the exascale: OpenFOAM perspective Ivan Spisso 25-27 March 2015, Casalecchio di Reno, BOLOGNA. SuperComputing Applications and Innovation Department,
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More information11 Projected Newton-type Methods in Machine Learning
11 Projected Newton-type Methods in Machine Learning Mark Schmidt University of British Columbia Vancouver, BC, V6T 1Z4 Dongmin Kim University of Texas at Austin Austin, Texas 78712 schmidtmarkw@gmail.com
More informationYevgeny Goncharov WORK EXPERIENCE
Yevgeny Goncharov Quantitative Risk Management 181 West Madison Street 41 st Floor Chicago, Illinois 60602 Phone: (312) 782-7716 yevgeny.goncharov@qrm.com WORK EXPERIENCE Academic Background 1998 2003
More informationChapter 7 Nonlinear Systems
Chapter 7 Nonlinear Systems Nonlinear systems in R n : X = B x. x n X = F (t; X) F (t; x ; :::; x n ) B C A ; F (t; X) =. F n (t; x ; :::; x n ) When F (t; X) = F (X) is independent of t; it is an example
More informationParallel Interior Point Solver for Structured Quadratic Programs: Application to Financial Planning Problems
Parallel Interior Point Solver for Structured uadratic Programs: Application to Financial Planning Problems Jacek Gondzio Andreas Grothey April 15th, 2003 MS-03-001 For other papers in this series see
More information