Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints

DOI10.1137/S1052623497332329zbMath0955.90134OpenAlexW2166758048MaRDI QIDQ4509737

Daniel Ralph, Houyuan Jiang

Publication date: 19 October 2000

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623497332329

zbMATH Keywords

global convergencesequential quadratic programmingcomplementarity problemssmoothing methodbilevel optimizationmathematical programs with equilibrium constraintsexact penaltygeneralized constraint qualification

Mathematics Subject Classification ID

Nonlinear programming (90C30) Game theory (91A99) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Smoothing and regularization strategies for optimization of hybrid dynamic systems, A pivoting algorithm for linear programming with linear complementarity constraints, A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints, Global convergence of a robust smoothing SQP method for semi-infinite programming, A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints, Global convergence of a smooth approximation method for mathematical programs with complementarity constraints, A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods, Feasible method for generalized semi-infinite programming, Three modeling paradigms in mathematical programming, MPCC strategies for nonsmooth nonlinear programs, First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition, Algorithms for linear programming with linear complementarity constraints, Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation, A new smoothing scheme for mathematical programs with complementarity constraints, A smoothing Newton method for mathematical programs governed by second-order cone constrained generalized equations, New constraint qualifications for mathematical programs with second-order cone complementarity constraints, New relaxation method for mathematical programs with complementarity constraints, The Convergence of a Levenberg–Marquardt Method for Nonlinear Inequalities, Improved Convergence Properties of the Relaxation Schemes of Kadrani et al. and Kanzow and Schwartz for MPEC, Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs, A smoothing SQP method for nonlinear programs with stability constraints arising from power systems, A log-exponential smoothing method for mathematical programs with complementarity constraints, A majorized penalty approach to inverse linear second order cone programming problems, On stochastic gradient and subgradient methods with adaptive steplength sequences, Model Order Reduction Techniques with a Posteriori Error Control for Nonlinear Robust Optimization Governed by Partial Differential Equations, 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, Monte Carlo and quasi-Monte Carlo sampling methods for a class of stochastic mathematical programs with equilibrium constraints, Smoothing method for mathematical programs with symmetric cone complementarity constraints, A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints, An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities, Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs, Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints, A general MPCC model and its solution algorithm for continuous network design problem, Smoothing partial exact penalty splitting method for mathematical programs with equilibrium constraints, Newton-type method for a class of mathematical programs with complementarity constraints, Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization, On the convergence of general regularization and smoothing schemes for mathematical programs with complementarity constraints, On the global minimization of the value-at-risk, Implicit smoothing and its application to optimization with piecewise smooth equality constraints, Active set algorithm for mathematical programs with linear complementarity constraints, Optimization problems with equilibrium constraints and their numerical solution., Solving mathematical programs with complementarity constraints as nonlinear programs, A modified relaxation scheme for mathematical programs with complementarity constraints, A smoothing method for solving portfolio optimization with CVaR and applications in allocation of generation asset, Parameter identification of quasibrittle materials as a mathematical program with equilibrium constraints, Hybrid approach with active set identification for mathematical programs with complementarity constraints, Partial augmented Lagrangian method and mathematical programs with complementarity constraints, A smoothing heuristic for a bilevel pricing problem, A robust SQP method for mathematical programs with linear complementarity constraints, An MPCC approach for stochastic Stackelberg–Nash–Cournot equilibrium, An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems, Convergence properties of a smoothing approach for mathematical programs with second-order cone complementarity constraints, An SQP algorithm for mathematical programs with nonlinear complementarity constraints, A global QP-free algorithm for mathematical programs with complementarity constraints, A perturbation approach for an inverse quadratic programming problem over second-order cones, Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs, A generalized project metric algorithm for mathematical programs with equilibrium constraints, A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints, A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints, Tikhonov regularization for mathematical programs with generalized complementarity constraints, A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints

Uses Software

• SolvOpt