A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
From MaRDI portal
Publication:812423
DOI10.1007/s10589-005-3230-5zbMath1122.90095OpenAlexW2039049002MaRDI QIDQ812423
Publication date: 23 January 2006
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-005-3230-5
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Methods of successive quadratic programming type (90C55)
Related Items
Quadratically constraint quadratical algorithm model for nonlinear minimax problems, A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization, A non-interior implicit smoothing approach to complementarity problems for frictionless contacts, A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function, A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application, A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints, An ADMM-based SQP method for separably smooth nonconvex optimization, A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization, A generalized project metric algorithm for mathematical programs with equilibrium constraints, A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A unified approach to interior point algorithms for linear complementary problems
- A new class of semismooth Newton-type methods for nonlinear complementarity problems
- Superlinear convergence of a stabilized SQP method to a degenerate solution
- Stabilized sequential quadratic programming
- OPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
- A smoothing method for mathematical programs with equilibrium constraints
- Stability of regularized bilevel programming problems
- A generalized projection-successive linear equations algorithm for nonlinearly equality and inequality constrained optimization and its rate of convergence
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- Constraint identification and algorithm stabilization for degenerate nonlinear programs
- Well-posedness and global attractors for the Burgers-Ginzburg-Landau equations.
- A numerical approach to optimization problems with variational inequality constraints
- A robust sequential quadratic programming method
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- On Optimization Problems with Variational Inequality Constraints
- A special newton-type optimization method
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- Degenerate Nonlinear Programming with a Quadratic Growth Condition
- Optimality Conditions for Optimization Problems with Complementarity Constraints
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- The nonlinear bilevel programming problem:formulations,regularity and optimality conditions
- Optimality conditions for bilevel programming problems
