A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints

DOI10.1023/A:1018359900133zbMath0904.90153OpenAlexW49930306MaRDI QIDQ1383834

Zhi-Quan Luo, Jong-Shi Pang, Masao Fukushima

Publication date: 19 January 1999

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

Full work available at URL: https://doi.org/10.1023/a:1018359900133

zbMATH Keywords

global convergencelinear complementaritysequential quadratic programmingmathematical programs with equilibrium constraints

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints, A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints, Feasibility problems with complementarity constraints, 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, Critical sets in one-parametric mathematical programs with complementarity constraints, Algorithms for linear programming with linear complementarity constraints, 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, On solving difference of convex functions programs with linear complementarity constraints, New relaxation method for mathematical programs with complementarity constraints, Improved Convergence Properties of the Relaxation Schemes of Kadrani et al. and Kanzow and Schwartz for MPEC, A log-exponential smoothing method for mathematical programs with complementarity constraints, Conic formulation of QPCCs applied to truly sparse QPs, A majorized penalty approach to inverse linear second order cone programming problems, Smoothing approach to Nash equilibrium formulations for a class of equilibrium problems with shared complementarity constraints, A robust signal control system for equilibrium flow under uncertain travel demand and traffic delay, Error bounds and finite termination for constrained optimization problems, A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function, A three-dimension null-space approach for mathematical programs with equilibrium constraints., DC programming: overview., Smoothing method for mathematical programs with symmetric cone complementarity constraints, A new smoothing technique for mathematical programs with equilibrium 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, A globally convergent sequential linear programming algorithm for mathematical programs with linear complementarity constraints, A comparison of solution approaches for the numerical treatment of or-constrained optimization problems, On structural safety assessment by load factor maximization in piecewise linear plasticity, Complementarity active-set algorithm for mathematical programming problems 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 global minimization of the value-at-risk, A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints, Some non-interior path-following methods based on a scaled central path for linear complementarity problems, A semidefinite programming heuristic for quadratic programming problems with complementarity constraints, A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints, Solving mathematical programs with complementarity constraints as nonlinear programs, A modified relaxation scheme for mathematical programs with complementarity constraints, Global optimization method for solving mathematical programs with linear complementarity constraints, Smoothing methods for nonsmooth, nonconvex minimization, 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, Exact penalty functions for convex bilevel programming problems., Partial exact penalty for mathematical programs with equilibrium constraints, 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, Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation, A continuation method for (strongly) monotone variational inequalities, Dynamic programming approach to discrete time dynamic feedback Stackelberg games with independent and dependent followers, 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, Further investigation on feasibility of mathematical programs with equilibrium constraints, Tikhonov regularization for mathematical programs with generalized complementarity constraints, Bilevel optimization for calibrating point spread functions in blind deconvolution, A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints