Semismooth SQP method for equality-constrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraints
DOI10.1080/10556788.2011.557727zbMATH Open1254.90228OpenAlexW2133816205MaRDI QIDQ3096884FDOQ3096884
Authors: A. L. Pogosyan, A. F. Izmailov, M. V. Solodov 
Publication date: 15 November 2011
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2011.557727
Recommendations
- Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
- An SQP algorithm for mathematical programs with nonlinear complementarity constraints
- A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints
- A strongly and superlinearly convergent SQP algorithm for optimization problems with linear complementarity constraints
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
sequential quadratic programmingsecond-order sufficiencysemismooth Newton methodmathematical programs with complementarity constraints\(B\)-differentialsemismoothness\(B\,D\)-regularity
Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Benchmarking optimization software with performance profiles.
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- A nonsmooth version of Newton's method
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Optimization and nonsmooth analysis
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Solving mathematical programs with complementarity constraints as nonlinear programs
- An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
- On second-order sufficient optimality conditions for c 1,1-optimization problems
- Mathematical Programs with Equilibrium Constraints
- Inexact Newton methods for solving nonsmooth equations
- Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems
- Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time
- Local convergence of quasi-Newton methods for B-differentiable equations
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- Computational schemes for large-scale problems in extended linear- quadratic programming
- The Theory of 2-Regularity for Mappings with Lipschitzian Derivatives and its Applications to Optimality Conditions
Cited In (3)
Uses Software
This page was built for publication: Semismooth SQP method for equality-constrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3096884)
