Solving MPECs Implicit Programming and NLP Methods
|
|
- Valentine Cox
- 5 years ago
- Views:
Transcription
1 Solving MPECs Implicit Programming and NLP Methods Michal Kočvara Academy of Sciences of the Czech Republic September
2 Mathematical Programs with Equilibrium Constraints Mechanical motivation Mechanical equilibrium (static problems): min Π( u) s.t. u K E( u) Π( u)... (quadratic) potential energy u... displacements K... set (cone) of admissible dispalcements When K space Π( u) = 0, A u f = 0 September
3 Mathematical Programs with Equilibrium Constraints Mechanical motivation Mechanical equilibrium (static problems): min Π(α, u) s.t. u K(α) E(α, u) Π(α, u)... (quadratic) potential energy u... displacements K(α)... set (cone) of admissible dispalcements When K space Π(α, u) = 0, A(α)u f(α) = 0 α... shape of elastic body, thickness, load, material properties, boundary conditions,... September
4 Mathematical Programs with Equilibrium Constraints MPEC: Mechanical motivation min α,u F(α, u) s.t. α U ad u solves E(α, u) F(α, u)... cost functional α... design variable u... state variable U ad... admissible designs natural MPEC September
5 Solving MPECs: ImP and NLP Methods... What is Implicit Programming? min α,u F(α, u) s.t. α U ad u solves E(α, u) Define solution map S : α u of E(α, u). Assume: (A1) F continuously differentiable on à R k, U ad à (A2) S single-valued on à (A3) E strongly regular at all points (α, u) with α Ã, u = S(α) September
6 Implicit Programming (ImP) Technique Using S, write as min α,u s.t. F(α, u) α U ad u solves E(α, u) min Θ(α) := F(α, S(α)) α α U ad s.t. Standard (but nonsmooth) optimization problem Solve by any nonsmooth algorithm, e.g. BT (Bundle-Trust region). September
7 Solving MPEC by ImP and BT min Θ(α) := F(α, S(α)) α α U ad s.t. To use BT, one needs, at each iterate α k the function value Θ(α k ) and main task: compute S(α) (solve E) one element (subgradient) of the generalized Jacobian Θ(α k ) implicit programming technique developed in 90s Outrata-MK-Zowe, Kluwer 1998 September
8 Solving MPEC by ImP and BT (example) Example: convex quadratic equilibrium problem min u, C(α)u b(α), u 2 Au = c s.t. u 1 Bu d Denote λ... Lagrangian multiplier for inequality constraints Adjoint problem: 1 min p 2 p, C(α)p uf(α, u), p s.t. Ap = 0 B j p = 0, j I + (α, u) M i (α, u) September
9 Solving MPEC by ImP and BT (example cont.) Adjoint problem: 1 min p 2 p, C(α)p uf(α, u), p s.t. Ap = 0 B j p = 0, j I + (α, u) M i (α, u) where I(α, u) = I + (α, u) = {i {1, 2,..., m} B i, u = d i} { } i I(α, u) λ i > 0 I 0 (α, u) = I(α, u) \ I + (x, u). September
10 Solving MPEC by ImP and BT (example cont.) Adjoint problem: Then min u, C(α)u b(α), u 2 Au = c s.t. u 1 Bu d 1 min p 2 p, C(α)p uf(α, u), p s.t. Ap = 0 B j p = 0, j I + (α, u) M i (α, u) α f(α, u) [ α (C(α)u b(α))] T p Θ(α) September
11 Solving MPEC by ImP and BT + min Θ(α) := F(α, S(α)) α α U ad s.t. BT particularly efficient for few variables difficult nonsmoothness only one subgradient available variables separated, E solved by special solvers (high dimension) single-valuedness of S (sometimes) nonsmooth codes not efficient and robust September
12 MP with Complementarity Constraints (MPCC) min F(z) s.t. g j (z) 0, j J eq g j (z) = 0, j J in 0 z 1 z 2 0 z = (z 0, z 1, z 2 ), z 0... control variable (α) z 1... state variable of E z 2... multipler of E September
13 MPCC and MPEC MPCC is almost a subset of MPEC MPEC MPCC: optimum desing with given friction Coulomb friction hemivariational inequalities MPEC MPCC: z = (z 1, z 2 ) (no control variable) may look as formal reason but it excludes ImP technique MPEC MPCC min F(u) u u solves E(u) s.t. September
14 Solution Techniques for MPCC Note that min F(z) s.t. g j (z) 0, j J eq g j (z) = 0, j J in z 1 0, z 2 0, z1 T z 2 = 0 is an NLP as such. BUT: Mangasarian Fromowitz constraint qualification (MFCQ) for this problem is violated at all feasible points expect serious difficulties of standard NLP algorithms. September
15 Solution Techniques for MPCC (cont.) Several techniques proposed: replace z T 1 z 2 = 0 by z T 1 z 2 τ with some τ > 0 solve a sequence of problems with τ 0 Scheel-Scholtes, Ferris-Kanzow. replace 0 z 1 z 2 0 by a smooth equation: smoothened min-function (Facchinei et al.) (z i 1 zi 2 )2 + 4τ z i 1 zi 2 = 0 smoothened Fischer-Burmeister function (Jiang and Ralph) (z i 1 )2 + (z i 2 )2 + τ z i 1 zi 2 = 0 with τ > 0. Solve (inexactly) a sequence of NLPs with τ 0. September
16 Solution Techniques for MPCC (cont.) A direct NLP approach (recently mostly used) Sven Leyffer 1999: (Scheel-Scholtes, Anitescu) Formulate MPCC as NLP, use SQP solvers: min F(z) s.t. g j (z) 0, j J eq g j (z) = 0, j J in z 1 0, z 2 0, z1 T z 2 0 This NLP does not satisfy MFCQ, but why not trying... Experience: many NLP solvers do not work but some do! September
17 Why does this work? MFCQ not satisfied Lagrangian multipliers unbounded. Fletcher et al.: there exists a basic multiplier; the multiplier set is a ray based in this basic multiplier vector. SQP methods converge quadratically to the basic multiplier, provided all QP subproblems remain consistent. MFCQ not satisfied QP subproblem in SQP may be inconsistent. Anitescu: elastic mode, implemented in some SQP codes (SNOPT) helps. Modify the NLP by relaxing the constraints and add a penalty term to the objective function. SQP with elastic mode converges globally. September
18 What about interior-point codes? l penalization (used e.g. by LOQO): replace min F(z) s.t. g j (z) 0, j J eq g j (z) = 0, j J in z 1 0, z 2 0, z T 1 z 2 = 0 by min F(z) + ρζ s.t. g j (z) 0, j J eq g j (z) = 0, j J in z 1 0, z 2 0, ζ 0, z i 1 zi 2 ζ i September
19 Penalization not globally convergent! Anitescu: Any solution to MPCC is a solution to the penalized problem with large enough ρ BUT: the converse is no true. No matter how large the penalty, there will always be solutions of the penalized problem which are not solutions for MPCC. September
20 ImP-MPEC vs. NLP-MPCC ImP-MPEC separated variables well-structured for BT uniqueness of E nonsmooth solvers not robust no state constraints can solve non-mpcc problems NLP-MPCC works on Cartesian product design var. = state var. no uniqueness of E needed robust NLP solvers can handle state constraints can solve non-mpec problems MPEC MPCC September
21 ImP-MPEC and NLP-MPCC face-to-face MacMPEC collection of Sven Leyffer: obstacle problem problem size obj. LOQO PENNON pack-rig Nwt 0.2s 149 Nwt 1s pack-rig Nwt 3s 309 Nwt 16s pack-rig failure 1129 Nwt 5m44s pack-rig Nwt 0.4s 198 Nwt 2s pack-rig (Infeas) failure pack-rig (Infeas) failure September
22 ImP-MPEC and NLP-MPCC face-to-face MacMPEC collection of Sven Leyffer: obstacle problem problem size obj. PENNON ImP+BT pack-rig Nwt 1s 83 fun 0.2s pack-rig Nwt 16s 59 fun 0.8s pack-rig Nwt 5m44s 114 fun 7.4s pack-rig Nwt 2s 69 fun 0.2s pack-rig (Infeas) failure 91 fun 1.3s pack-rig (Infeas) failure 158 fun 10.5s September
University of Erlangen-Nürnberg and Academy of Sciences of the Czech Republic. Solving MPECs by Implicit Programming and NLP Methods p.
Solving MPECs by Implicit Programming and NLP Methods Michal Kočvara University of Erlangen-Nürnberg and Academy of Sciences of the Czech Republic Solving MPECs by Implicit Programming and NLP Methods
More informationNonlinear Programming, Elastic Mode, SQP, MPEC, MPCC, complementarity
Preprint ANL/MCS-P864-1200 ON USING THE ELASTIC MODE IN NONLINEAR PROGRAMMING APPROACHES TO MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS MIHAI ANITESCU Abstract. We investigate the possibility
More informationSolving a Signalized Traffic Intersection Problem with NLP Solvers
Solving a Signalized Traffic Intersection Problem with NLP Solvers Teófilo Miguel M. Melo, João Luís H. Matias, M. Teresa T. Monteiro CIICESI, School of Technology and Management of Felgueiras, Polytechnic
More informationEffective reformulations of the truss topology design problem
Effective reformulations of the truss topology design problem Michal Kočvara and Jiří V. Outrata Abstract We present a new formulation of the truss topology problem that results in unique design and unique
More informationA FRITZ JOHN APPROACH TO FIRST ORDER OPTIMALITY CONDITIONS FOR MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS
A FRITZ JOHN APPROACH TO FIRST ORDER OPTIMALITY CONDITIONS FOR MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS Michael L. Flegel and Christian Kanzow University of Würzburg Institute of Applied Mathematics
More informationNonlinear Optimization Solvers
ICE05 Argonne, July 19, 2005 Nonlinear Optimization Solvers Sven Leyffer leyffer@mcs.anl.gov Mathematics & Computer Science Division, Argonne National Laboratory Nonlinear Optimization Methods Optimization
More informationEquilibrium Programming
International Conference on Continuous Optimization Summer School, 1 August 2004 Rensselaer Polytechnic Institute Tutorial on Equilibrium Programming Danny Ralph Judge Institute of Management, Cambridge
More informationInterior Methods for Mathematical Programs with Complementarity Constraints
Interior Methods for Mathematical Programs with Complementarity Constraints Sven Leyffer, Gabriel López-Calva and Jorge Nocedal July 14, 25 Abstract This paper studies theoretical and practical properties
More informationEffective reformulations of the truss topology design problem
Effective reformulations of the truss topology design problem Michal Kočvara and Jiří V. Outrata Abstract We present a new formulation of the truss topology problem that results in unique design and unique
More informationINTERIOR-POINT ALGORITHMS, PENALTY METHODS AND EQUILIBRIUM PROBLEMS
INTERIOR-POINT ALGORITHMS, PENALTY METHODS AND EQUILIBRIUM PROBLEMS HANDE Y. BENSON, ARUN SEN, DAVID F. SHANNO, AND ROBERT J. VANDERBEI Abstract. In this paper we consider the question of solving equilibrium
More information1. Introduction. We consider mathematical programs with equilibrium constraints in the form of complementarity constraints:
SOME PROPERTIES OF REGULARIZATION AND PENALIZATION SCHEMES FOR MPECS DANIEL RALPH AND STEPHEN J. WRIGHT Abstract. Some properties of regularized and penalized nonlinear programming formulations of mathematical
More informationINTERIOR-POINT METHODS FOR NONCONVEX NONLINEAR PROGRAMMING: COMPLEMENTARITY CONSTRAINTS
INTERIOR-POINT METHODS FOR NONCONVEX NONLINEAR PROGRAMMING: COMPLEMENTARITY CONSTRAINTS HANDE Y. BENSON, DAVID F. SHANNO, AND ROBERT J. VANDERBEI Operations Research and Financial Engineering Princeton
More informationAN EXACT PENALTY APPROACH FOR MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS. L. Abdallah 1 and M. Haddou 2
AN EXACT PENALTY APPROACH FOR MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS. L. Abdallah 1 and M. Haddou 2 Abstract. We propose an exact penalty approach to solve the mathematical problems with equilibrium
More informationSolving Multi-Leader-Follower Games
ARGONNE NATIONAL LABORATORY 9700 South Cass Avenue Argonne, Illinois 60439 Solving Multi-Leader-Follower Games Sven Leyffer and Todd Munson Mathematics and Computer Science Division Preprint ANL/MCS-P1243-0405
More information1. Introduction. Consider the generic mathematical program with equilibrium constraints (MPEC), expressed as
SIAM J. OPTIM. Vol. 16, No. 2, pp. 587 609 c 2005 Society for Industrial and Applied Mathematics A TWO-SIDED RELAXATION SCHEME FOR MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS VICTOR DEMIGUEL, MICHAEL
More informationSolving Multi-Leader-Common-Follower Games
ARGONNE NATIONAL LABORATORY 9700 South Cass Avenue Argonne, Illinois 60439 Solving Multi-Leader-Common-Follower Games Sven Leyffer and Todd Munson Mathematics and Computer Science Division Preprint ANL/MCS-P1243-0405
More informationINTERIOR-POINT METHODS FOR NONCONVEX NONLINEAR PROGRAMMING: CONVERGENCE ANALYSIS AND COMPUTATIONAL PERFORMANCE
INTERIOR-POINT METHODS FOR NONCONVEX NONLINEAR PROGRAMMING: CONVERGENCE ANALYSIS AND COMPUTATIONAL PERFORMANCE HANDE Y. BENSON, ARUN SEN, AND DAVID F. SHANNO Abstract. In this paper, we present global
More informationOn Walras-Cournot-Nash equilibria and their computation
On Walras-Cournot-Nash equilibria and their computation Jiří V. Outrata, Michal Červinka, Michal Outrata Institute of Information Theory and Automation, Czech Academy of Sciences, Prague, Czech Republic
More information1. Introduction. We consider the mathematical programming problem
SIAM J. OPTIM. Vol. 15, No. 1, pp. 210 228 c 2004 Society for Industrial and Applied Mathematics NEWTON-TYPE METHODS FOR OPTIMIZATION PROBLEMS WITHOUT CONSTRAINT QUALIFICATIONS A. F. IZMAILOV AND M. V.
More informationINTERIOR-POINT ALGORITHMS, PENALTY METHODS AND EQUILIBRIUM PROBLEMS
INTERIOR-POINT ALGORITHMS, PENALTY METHODS AND EQUILIBRIUM PROBLEMS HANDE Y. BENSON, ARUN SEN, DAVID F. SHANNO, AND ROBERT J. VANDERBEI Abstract. In this paper we consider the question of solving equilibrium
More informationFIRST- AND SECOND-ORDER OPTIMALITY CONDITIONS FOR MATHEMATICAL PROGRAMS WITH VANISHING CONSTRAINTS 1. Tim Hoheisel and Christian Kanzow
FIRST- AND SECOND-ORDER OPTIMALITY CONDITIONS FOR MATHEMATICAL PROGRAMS WITH VANISHING CONSTRAINTS 1 Tim Hoheisel and Christian Kanzow Dedicated to Jiří Outrata on the occasion of his 60th birthday Preprint
More informationCONVERGENCE ANALYSIS OF AN INTERIOR-POINT METHOD FOR NONCONVEX NONLINEAR PROGRAMMING
CONVERGENCE ANALYSIS OF AN INTERIOR-POINT METHOD FOR NONCONVEX NONLINEAR PROGRAMMING HANDE Y. BENSON, ARUN SEN, AND DAVID F. SHANNO Abstract. In this paper, we present global and local convergence results
More informationInfeasibility Detection in Nonlinear Optimization
Infeasibility Detection in Nonlinear Optimization Frank E. Curtis, Lehigh University Hao Wang, Lehigh University SIAM Conference on Optimization 2011 May 16, 2011 (See also Infeasibility Detection in Nonlinear
More informationSF2822 Applied Nonlinear Optimization. Preparatory question. Lecture 9: Sequential quadratic programming. Anders Forsgren
SF2822 Applied Nonlinear Optimization Lecture 9: Sequential quadratic programming Anders Forsgren SF2822 Applied Nonlinear Optimization, KTH / 24 Lecture 9, 207/208 Preparatory question. Try to solve theory
More informationAN ABADIE-TYPE CONSTRAINT QUALIFICATION FOR MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS. Michael L. Flegel and Christian Kanzow
AN ABADIE-TYPE CONSTRAINT QUALIFICATION FOR MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS Michael L. Flegel and Christian Kanzow University of Würzburg Institute of Applied Mathematics and Statistics
More informationInfeasibility Detection and an Inexact Active-Set Method for Large-Scale Nonlinear Optimization
Infeasibility Detection and an Inexact Active-Set Method for Large-Scale Nonlinear Optimization Frank E. Curtis, Lehigh University involving joint work with James V. Burke, University of Washington Daniel
More informationPacific Journal of Optimization (Vol. 2, No. 3, September 2006) ABSTRACT
Pacific Journal of Optimization Vol., No. 3, September 006) PRIMAL ERROR BOUNDS BASED ON THE AUGMENTED LAGRANGIAN AND LAGRANGIAN RELAXATION ALGORITHMS A. F. Izmailov and M. V. Solodov ABSTRACT For a given
More informationA DC (DIFFERENCE OF CONVEX FUNCTIONS) APPROACH OF THE MPECS. Matthieu Marechal. Rafael Correa. (Communicated by the associate editor name)
Manuscript submitted to AIMS Journals Volume X, Number 0X, XX 200X Website: http://aimsciences.org pp. X XX A DC (DIFFERENCE OF CONVEX FUNCTIONS) APPROACH OF THE MPECS Matthieu Marechal Centro de Modelamiento
More informationPENNON A Generalized Augmented Lagrangian Method for Nonconvex NLP and SDP p.1/22
PENNON A Generalized Augmented Lagrangian Method for Nonconvex NLP and SDP Michal Kočvara Institute of Information Theory and Automation Academy of Sciences of the Czech Republic and Czech Technical University
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. ABSTRACTS of the invited
More informationPenalty and Barrier Methods General classical constrained minimization problem minimize f(x) subject to g(x) 0 h(x) =0 Penalty methods are motivated by the desire to use unconstrained optimization techniques
More informationmin s.t. h(x, w, y) = 0 x 0 0 w y 0
AN INTERIOR POINT METHOD FOR MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS (MPCCS) ARVIND U. RAGHUNATHAN AND LORENZ T. BIEGLER Abstract. Interior point methods for nonlinear programs (NLP) are
More informationA New Penalty-SQP Method
Background and Motivation Illustration of Numerical Results Final Remarks Frank E. Curtis Informs Annual Meeting, October 2008 Background and Motivation Illustration of Numerical Results Final Remarks
More informationNUMERICAL OPTIMIZATION. J. Ch. Gilbert
NUMERICAL OPTIMIZATION J. Ch. Gilbert Numerical optimization (past) The discipline deals with the classical smooth (nonconvex) problem min {f(x) : c E (x) = 0, c I (x) 0}. Applications: variable added
More informationExamples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints
Comput Optim Appl (2009) 42: 231 264 DOI 10.1007/s10589-007-9074-4 Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints A.F. Izmailov M.V. Solodov Received:
More informationSolving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization
Math. Program., Ser. B 2009 116:343 368 DOI 10.1007/s10107-007-0119-3 FULL LENGTH PAPER Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming
More informationA Sequential NCP Algorithm for Solving Equilibrium Problems with Equilibrium Constraints
A Sequential NCP Algorithm for Solving Equilibrium Problems with Equilibrium Constraints Che-Lin Su Original: October 30, 2004; Revision: November 28, 2004 Abstract. This paper studies algorithms for equilibrium
More informationAn Inexact Sequential Quadratic Optimization Method for Nonlinear Optimization
An Inexact Sequential Quadratic Optimization Method for Nonlinear Optimization Frank E. Curtis, Lehigh University involving joint work with Travis Johnson, Northwestern University Daniel P. Robinson, Johns
More informationMathematical programs with complementarity constraints in Banach spaces
Mathematical programs with complementarity constraints in Banach spaces Gerd Wachsmuth July 21, 2014 We consider optimization problems in Banach spaces involving a complementarity constraint defined by
More informationComputation of Moral-Hazard Problems
Computation of Moral-Hazard Problems Che-Lin Su Kenneth L Judd First Draft: January 26, 2005 Abstract This paper studies computational aspects of moral-hazard problems In particular, we consider deterministic
More informationSteering Exact Penalty Methods for Nonlinear Programming
Steering Exact Penalty Methods for Nonlinear Programming Richard H. Byrd Jorge Nocedal Richard A. Waltz April 10, 2007 Technical Report Optimization Technology Center Northwestern University Evanston,
More informationAlgorithms for Linear Programming with Linear Complementarity Constraints
Algorithms for Linear Programming with Linear Complementarity Constraints Joaquim J. Júdice E-Mail: joaquim.judice@co.it.pt June 8, 2011 Abstract Linear programming with linear complementarity constraints
More informationc 2012 Society for Industrial and Applied Mathematics
SIAM J. OPTIM. Vol. 22, No. 4, pp. 1579 166 c 212 Society for Industrial and Applied Mathematics GLOBAL CONVERGENCE OF AUGMENTED LAGRANGIAN METHODS APPLIED TO OPTIMIZATION PROBLEMS WITH DEGENERATE CONSTRAINTS,
More informationComputation of Moral-Hazard Problems
Computation of Moral-Hazard Problems Che-Lin Su Kenneth L Judd September 16, 2005 Abstract We study computational aspects of moral-hazard problems In particular, we consider deterministic contracts as
More informationA Continuation Method for the Solution of Monotone Variational Inequality Problems
A Continuation Method for the Solution of Monotone Variational Inequality Problems Christian Kanzow Institute of Applied Mathematics University of Hamburg Bundesstrasse 55 D 20146 Hamburg Germany e-mail:
More informationAlgorithms for Constrained Optimization
1 / 42 Algorithms for Constrained Optimization ME598/494 Lecture Max Yi Ren Department of Mechanical Engineering, Arizona State University April 19, 2015 2 / 42 Outline 1. Convergence 2. Sequential quadratic
More informationConstrained Nonlinear Optimization Algorithms
Department of Industrial Engineering and Management Sciences Northwestern University waechter@iems.northwestern.edu Institute for Mathematics and its Applications University of Minnesota August 4, 2016
More informationLecture 3: Lagrangian duality and algorithms for the Lagrangian dual problem
Lecture 3: Lagrangian duality and algorithms for the Lagrangian dual problem Michael Patriksson 0-0 The Relaxation Theorem 1 Problem: find f := infimum f(x), x subject to x S, (1a) (1b) where f : R n R
More informationConstraint Qualifications and Stationarity Concepts for Mathematical Programs with Equilibrium Constraints
Constraint Qualifications and Stationarity Concepts for Mathematical Programs with Equilibrium Constraints Michael L. Flegel Dissertation Institute of Applied Mathematics and Statistics University of Würzburg
More informationComputing Solutions of Moral-Hazard Problems
Computing Solutions of Moral-Hazard Problems Che-Lin Su Dept of Management Science and Engineering Stanford University Joint work with Kenneth L Judd Hoover Institution Stanford, CA 94305 July 19, 2005
More informationFirst-order optimality conditions for mathematical programs with second-order cone complementarity constraints
First-order optimality conditions for mathematical programs with second-order cone complementarity constraints Jane J. Ye Jinchuan Zhou Abstract In this paper we consider a mathematical program with second-order
More informationA Smoothing SQP Method for Mathematical Programs with Linear Second-Order Cone Complementarity Constraints
A Smoothing SQP Method for Mathematical Programs with Linear Second-Order Cone Complementarity Constraints Hiroshi Yamamura, Taayui Ouno, Shunsue Hayashi and Masao Fuushima June 14, 212 Abstract In this
More informationA Hard Constraint Time-Stepping Approach for Rigid Multibody Dynamics with Joints, Contact and Friction. Gary D. Hart University of Pittsburgh
A Hard Constraint Time-Stepping Approach for Rigid Multibody Dynamics with Joints, Contact and Friction Gary D. Hart University of Pittsburgh 1 Goal Develop method for simulating rigid multibody dynamics
More informationMODIFYING SQP FOR DEGENERATE PROBLEMS
PREPRINT ANL/MCS-P699-1097, OCTOBER, 1997, (REVISED JUNE, 2000; MARCH, 2002), MATHEMATICS AND COMPUTER SCIENCE DIVISION, ARGONNE NATIONAL LABORATORY MODIFYING SQP FOR DEGENERATE PROBLEMS STEPHEN J. WRIGHT
More informationCombinatorial Structures in Nonlinear Programming
Combinatorial Structures in Nonlinear Programming Stefan Scholtes April 2002 Abstract Non-smoothness and non-convexity in optimization problems often arise because a combinatorial structure is imposed
More information5 Handling Constraints
5 Handling Constraints Engineering design optimization problems are very rarely unconstrained. Moreover, the constraints that appear in these problems are typically nonlinear. This motivates our interest
More information5.5 Quadratic programming
5.5 Quadratic programming Minimize a quadratic function subject to linear constraints: 1 min x t Qx + c t x 2 s.t. a t i x b i i I (P a t i x = b i i E x R n, where Q is an n n matrix, I and E are the
More informationAlgorithms for constrained local optimization
Algorithms for constrained local optimization Fabio Schoen 2008 http://gol.dsi.unifi.it/users/schoen Algorithms for constrained local optimization p. Feasible direction methods Algorithms for constrained
More information1. Introduction. We consider the general smooth constrained optimization problem:
OPTIMIZATION TECHNICAL REPORT 02-05, AUGUST 2002, COMPUTER SCIENCES DEPT, UNIV. OF WISCONSIN TEXAS-WISCONSIN MODELING AND CONTROL CONSORTIUM REPORT TWMCC-2002-01 REVISED SEPTEMBER 2003. A FEASIBLE TRUST-REGION
More informationConstraint Identification and Algorithm Stabilization for Degenerate Nonlinear Programs
Preprint ANL/MCS-P865-1200, Dec. 2000 (Revised Nov. 2001) Mathematics and Computer Science Division Argonne National Laboratory Stephen J. Wright Constraint Identification and Algorithm Stabilization for
More information1. Introduction. We consider the following mathematical program with equilibrium constraints (MPEC), all of whose constraint functions are linear:
MULTIPLIER CONVERGENCE IN TRUST-REGION METHODS WITH APPLICATION TO CONVERGENCE OF DECOMPOSITION METHODS FOR MPECS GIOVANNI GIALLOMBARDO AND DANIEL RALPH Abstract. We study piecewise decomposition methods
More informationCS6375: Machine Learning Gautam Kunapuli. Support Vector Machines
Gautam Kunapuli Example: Text Categorization Example: Develop a model to classify news stories into various categories based on their content. sports politics Use the bag-of-words representation for this
More informationA PENALIZED FISCHER-BURMEISTER NCP-FUNCTION. September 1997 (revised May 1998 and March 1999)
A PENALIZED FISCHER-BURMEISTER NCP-FUNCTION Bintong Chen 1 Xiaojun Chen 2 Christian Kanzow 3 September 1997 revised May 1998 and March 1999 Abstract: We introduce a new NCP-function in order to reformulate
More informationSurvey of NLP Algorithms. L. T. Biegler Chemical Engineering Department Carnegie Mellon University Pittsburgh, PA
Survey of NLP Algorithms L. T. Biegler Chemical Engineering Department Carnegie Mellon University Pittsburgh, PA NLP Algorithms - Outline Problem and Goals KKT Conditions and Variable Classification Handling
More informationMS&E 318 (CME 338) Large-Scale Numerical Optimization
Stanford University, Management Science & Engineering (and ICME) MS&E 318 (CME 338) Large-Scale Numerical Optimization 1 Origins Instructor: Michael Saunders Spring 2015 Notes 9: Augmented Lagrangian Methods
More informationA Primal-Dual Augmented Lagrangian Penalty-Interior-Point Filter Line Search Algorithm
Journal name manuscript No. (will be inserted by the editor) A Primal-Dual Augmented Lagrangian Penalty-Interior-Point Filter Line Search Algorithm Rene Kuhlmann Christof Büsens Received: date / Accepted:
More informationComplementarity Formulations of l 0 -norm Optimization Problems
Complementarity Formulations of l 0 -norm Optimization Problems Mingbin Feng, John E. Mitchell,Jong-Shi Pang, Xin Shen, Andreas Wächter Original submission: September 23, 2013. Revised January 8, 2015
More informationarxiv:math/ v1 [math.oc] 20 Dec 2000
Preprint ANL/MCS-P865-1200, December, 2000 Mathematics and Computer Science Division Argonne National Laboratory arxiv:math/0012209v1 [math.oc] 20 Dec 2000 Stephen J. Wright Constraint Identification and
More informationAN AUGMENTED LAGRANGIAN AFFINE SCALING METHOD FOR NONLINEAR PROGRAMMING
AN AUGMENTED LAGRANGIAN AFFINE SCALING METHOD FOR NONLINEAR PROGRAMMING XIAO WANG AND HONGCHAO ZHANG Abstract. In this paper, we propose an Augmented Lagrangian Affine Scaling (ALAS) algorithm for general
More informationRelaxed linearized algorithms for faster X-ray CT image reconstruction
Relaxed linearized algorithms for faster X-ray CT image reconstruction Hung Nien and Jeffrey A. Fessler University of Michigan, Ann Arbor The 13th Fully 3D Meeting June 2, 2015 1/20 Statistical image reconstruction
More informationKey words. constrained optimization, composite optimization, Mangasarian-Fromovitz constraint qualification, active set, identification.
IDENTIFYING ACTIVITY A. S. LEWIS AND S. J. WRIGHT Abstract. Identification of active constraints in constrained optimization is of interest from both practical and theoretical viewpoints, as it holds the
More informationSEQUENTIAL QUADRATIC PROGAMMING METHODS FOR PARAMETRIC NONLINEAR OPTIMIZATION
SEQUENTIAL QUADRATIC PROGAMMING METHODS FOR PARAMETRIC NONLINEAR OPTIMIZATION Vyacheslav Kungurtsev Moritz Diehl July 2013 Abstract Sequential quadratic programming (SQP) methods are known to be efficient
More information2.3 Linear Programming
2.3 Linear Programming Linear Programming (LP) is the term used to define a wide range of optimization problems in which the objective function is linear in the unknown variables and the constraints are
More informationNumerical Optimal Control Part 3: Function space methods
Numerical Optimal Control Part 3: Function space methods SADCO Summer School and Workshop on Optimal and Model Predictive Control OMPC 2013, Bayreuth Institute of Mathematics and Applied Computing Department
More informationFirst order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints Chao Ding, Defeng Sun and Jane J. Ye November 15, 2010 Abstract In this paper we consider
More informationPriority Programme 1962
Priority Programme 1962 An Example Comparing the Standard and Modified Augmented Lagrangian Methods Christian Kanzow, Daniel Steck Non-smooth and Complementarity-based Distributed Parameter Systems: Simulation
More informationA note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems
Math. Program., Ser. A (2013) 142:591 604 DOI 10.1007/s10107-012-0586-z SHORT COMMUNICATION A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems
More informationMINLP: Theory, Algorithms, Applications: Lecture 3, Basics of Algorothms
MINLP: Theory, Algorithms, Applications: Lecture 3, Basics of Algorothms Jeff Linderoth Industrial and Systems Engineering University of Wisconsin-Madison Jonas Schweiger Friedrich-Alexander-Universität
More informationB- AND STRONG STATIONARITY FOR OPTIMAL CONTROL OF STATIC PLASTICITY WITH HARDENING ROLAND HERZOG, CHRISTIAN MEYER, AND GERD WACHSMUTH
B- AND STRONG STATIONARITY FOR OPTIMAL CONTROL OF STATIC PLASTICITY WITH HARDENING ROLAND HERZOG, CHRISTIAN MEYER, AND GERD WACHSMUTH Abstract. Optimal control problems for the variational inequality of
More informationA Constraint-Reduced MPC Algorithm for Convex Quadratic Programming, with a Modified Active-Set Identification Scheme
A Constraint-Reduced MPC Algorithm for Convex Quadratic Programming, with a Modified Active-Set Identification Scheme M. Paul Laiu 1 and (presenter) André L. Tits 2 1 Oak Ridge National Laboratory laiump@ornl.gov
More informationThe use of second-order information in structural topology optimization. Susana Rojas Labanda, PhD student Mathias Stolpe, Senior researcher
The use of second-order information in structural topology optimization Susana Rojas Labanda, PhD student Mathias Stolpe, Senior researcher What is Topology Optimization? Optimize the design of a structure
More informationLower bounding problems for stress constrained. discrete structural topology optimization problems
FP 6 STREP 30717 PLATO N (Aeronautics and Space) PLATO N A PLAtform for Topology Optimisation incorporating Novel, Large-Scale, Free-Material Optimisation and Mixed Integer Programming Methods Lower bounding
More informationMingbin Feng, John E. Mitchell, Jong-Shi Pang, Xin Shen, Andreas Wächter
Complementarity Formulations of l 0 -norm Optimization Problems 1 Mingbin Feng, John E. Mitchell, Jong-Shi Pang, Xin Shen, Andreas Wächter Abstract: In a number of application areas, it is desirable to
More informationComplementarity Formulations of l 0 -norm Optimization Problems
Complementarity Formulations of l 0 -norm Optimization Problems Mingbin Feng, John E. Mitchell, Jong-Shi Pang, Xin Shen, Andreas Wächter May 17, 2016 Abstract In a number of application areas, it is desirable
More informationA STABILIZED SQP METHOD: SUPERLINEAR CONVERGENCE
A STABILIZED SQP METHOD: SUPERLINEAR CONVERGENCE Philip E. Gill Vyacheslav Kungurtsev Daniel P. Robinson UCSD Center for Computational Mathematics Technical Report CCoM-14-1 June 30, 2014 Abstract Regularized
More informationA GLOBALLY CONVERGENT STABILIZED SQP METHOD: SUPERLINEAR CONVERGENCE
A GLOBALLY CONVERGENT STABILIZED SQP METHOD: SUPERLINEAR CONVERGENCE Philip E. Gill Vyacheslav Kungurtsev Daniel P. Robinson UCSD Center for Computational Mathematics Technical Report CCoM-14-1 June 30,
More informationA Linear Complementarity Time-Stepping Scheme for Rigid Multibody Dynamics with Nonsmooth Shapes. Gary D. Hart University of Pittsburgh
A Linear Complementarity Time-Stepping Scheme for Rigid Multibody Dynamics with Nonsmooth Shapes. Gary D. Hart University of Pittsburgh 1 Introduction Nonsmooth rigid multibody dynamics (NRMD) methods
More informationWhat s New in Active-Set Methods for Nonlinear Optimization?
What s New in Active-Set Methods for Nonlinear Optimization? Philip E. Gill Advances in Numerical Computation, Manchester University, July 5, 2011 A Workshop in Honor of Sven Hammarling UCSD Center for
More informationLecture 15: SQP methods for equality constrained optimization
Lecture 15: SQP methods for equality constrained optimization Coralia Cartis, Mathematical Institute, University of Oxford C6.2/B2: Continuous Optimization Lecture 15: SQP methods for equality constrained
More informationWHEN ARE THE (UN)CONSTRAINED STATIONARY POINTS OF THE IMPLICIT LAGRANGIAN GLOBAL SOLUTIONS?
WHEN ARE THE (UN)CONSTRAINED STATIONARY POINTS OF THE IMPLICIT LAGRANGIAN GLOBAL SOLUTIONS? Francisco Facchinei a,1 and Christian Kanzow b a Università di Roma La Sapienza Dipartimento di Informatica e
More information20 J.-S. CHEN, C.-H. KO AND X.-R. WU. : R 2 R is given by. Recently, the generalized Fischer-Burmeister function ϕ p : R2 R, which includes
016 0 J.-S. CHEN, C.-H. KO AND X.-R. WU whereas the natural residual function ϕ : R R is given by ϕ (a, b) = a (a b) + = min{a, b}. Recently, the generalized Fischer-Burmeister function ϕ p : R R, which
More informationMultidisciplinary System Design Optimization (MSDO)
Multidisciplinary System Design Optimization (MSDO) Numerical Optimization II Lecture 8 Karen Willcox 1 Massachusetts Institute of Technology - Prof. de Weck and Prof. Willcox Today s Topics Sequential
More informationHot-Starting NLP Solvers
Hot-Starting NLP Solvers Andreas Wächter Department of Industrial Engineering and Management Sciences Northwestern University waechter@iems.northwestern.edu 204 Mixed Integer Programming Workshop Ohio
More informationAffine covariant Semi-smooth Newton in function space
Affine covariant Semi-smooth Newton in function space Anton Schiela March 14, 2018 These are lecture notes of my talks given for the Winter School Modern Methods in Nonsmooth Optimization that was held
More informationCOMPUTATION OF KUHN-TUCKER TRIPLES IN OPTIMUM DESIGN PROBLEMS IN THE PRESENCE OF PARAMETRIC SINGULARITIES
COMPUTATION OF KUHN-TUCKER TRIPLES IN OPTIMUM DESIGN PROBLEMS IN THE PRESENCE OF PARAMETRIC SINGULARITIES J. R. Jagannatha Rao* Assistant Professor, Department of Mechanical Engineering The University
More informationFirst order optimality conditions for mathematical programs with second-order cone complementarity constraints
First order optimality conditions for mathematical programs with second-order cone complementarity constraints Jane J. Ye and Jinchuan Zhou April 9, 05 Abstract In this paper we consider a mathematical
More informationIndex. calculus of variations, 247 car problem, 229, 238 cascading tank problem, 356 catalyst mixing problem, 240
Index A-stable, 255 absolute value, 338 absolutely stable, 255 absorption, 202 active constraints, 72 active set strongly active set, 73 weakly active set, 73 active set strategy, 134 Adams, 256 Adams
More informationarxiv: v1 [math.oc] 30 Mar 2017
Convergence of a Scholtes-type Regularization Method for Cardinality-Constrained Optimization Problems with an Application in Sparse Robust Portfolio Optimization Martin Branda 1,2, Max Bucher 3, Michal
More informationIntroduction. New Nonsmooth Trust Region Method for Unconstraint Locally Lipschitz Optimization Problems
New Nonsmooth Trust Region Method for Unconstraint Locally Lipschitz Optimization Problems Z. Akbari 1, R. Yousefpour 2, M. R. Peyghami 3 1 Department of Mathematics, K.N. Toosi University of Technology,
More informationOptimization Problems with Constraints - introduction to theory, numerical Methods and applications
Optimization Problems with Constraints - introduction to theory, numerical Methods and applications Dr. Abebe Geletu Ilmenau University of Technology Department of Simulation and Optimal Processes (SOP)
More information