Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints

DOI10.1007/s10589-010-9341-7zbMath1245.90124OpenAlexW2112391156MaRDI QIDQ434165

A. L. Pogosyan, Mikhail V. Solodov, Alexey F. Izmailov

Publication date: 10 July 2012

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-010-9341-7

zbMATH Keywords

merit functionsecond-order sufficiencymathematical program with complementarity constraintssemismooth Newton method\(BD\)-regularity

Mathematics Subject Classification ID

Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints, Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments, A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods, Active-set Newton methods for mathematical programs with vanishing constraints, The Josephy-Newton method for semismooth generalized equations and semismooth SQP for optimization, On the upper Lipschitz property of the KKT mapping for nonlinear semidefinite optimization, The demand adjustment problem via inexact restoration method, Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints, Analysis of Highly Accurate Finite Element Based Algorithms for Computing Distances to Level Sets, A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems, Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption, Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints, Reformulation of the M-Stationarity Conditions as a System of Discontinuous Equations and Its Solution by a Semismooth Newton Method, The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited

Uses Software

• MacMPEC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lifting mathematical programs with complementarity constraints
• On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions
• Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
• A new class of semismooth Newton-type methods for nonlinear complementarity problems
• A theoretical and numerical comparison of some semismooth algorithms for complementarity problems
• A nonsmooth version of Newton's method
• Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
• Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
• A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
• Nonsmooth Equations: Motivation and Algorithms
• An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
• EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
• Semismooth and Semiconvex Functions in Constrained Optimization
• Some properties of regularization and penalization schemes for MPECs
• Solving mathematical programs with complementarity constraints as nonlinear programs
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Global Convergence Analysis of the Generalized Newton and Gauss-Newton Methods of the Fischer-Burmeister Equation for the Complementarity Problem
• Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
• Benchmarking optimization software with performance profiles.