A global QP-free algorithm for mathematical programs with complementarity constraints
type: Item
instance of: scholarly article
title: A global QP-free algorithm for mathematical programs with complementarity constraints
zbMATH Open document ID: 1503.90132
author: Jian-Ling Li
author: Qi Zhang
published in: Journal of Inequalities and Applications
publication date: 2022-01-20T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C55
Mathematics Subject Classification ID: 49M37
zbMATH DE Number: 7460988
zbMATH Keywords: complementarity constraints
zbMATH Keywords: working set
zbMATH Keywords: QP-free algorithm
zbMATH Keywords: global convergence
describes a project that uses: MacMPEC
MaRDI profile type: Publication
full work available at URL: s13660-020-02479-6
OpenAlex ID: W3081642540
cites work: Engineering and Economic Applications of Complementarity Problems
cites work: Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
cites work: Foundations of bilevel programming
cites work: A successive quadratic programming algorithm with global and superlinear convergence properties
cites work: A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
cites work: A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
cites work: A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
cites work: New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
cites work: Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
cites work: Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
cites work: A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
cites work: Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
cites work: A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
cites work: Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
cites work: Q5498992
cites work: A new filter QP-free method for the nonlinear inequality constrained optimization problem
cites work: Q5160295
cites work: A QP-free constrained Newton-type method for variational inequality problems
cites work: A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
cites work: A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
cites work: A Feasible Active Set QP-Free Method for Nonlinear Programming
cites work: A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization
cites work: Primal-dual interior point QP-free algorithm for nonlinear constrained optimization
cites work: A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints
cites work: A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints
cites work: Q4484040
cites work: Feasible directions algorithms for optimization problems with equality and inequality constraints
cites work: A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
cites work: Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
cites work: On the Accurate Identification of Active Constraints
cites work: A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
cites work: Solving mathematical programs with complementarity constraints as nonlinear programs
DOI: 10.1186/S13660-020-02479-6
description: scientific article; zbMATH DE number 7460988