A global QP-free algorithm for mathematical programs with complementarity constraints
From MaRDI portal
Publication:2069554
DOI10.1186/s13660-020-02479-6zbMath1503.90132OpenAlexW3081642540MaRDI QIDQ2069554
Publication date: 20 January 2022
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-020-02479-6
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Methods of successive quadratic programming type (90C55)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
- A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
- A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints
- A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization
- A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints
- A new filter QP-free method for the nonlinear inequality constrained optimization problem
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- A QP-free constrained Newton-type method for variational inequality problems
- Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- Foundations of bilevel programming
- A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
- Primal-dual interior point QP-free algorithm for nonlinear constrained optimization
- A Feasible Active Set QP-Free Method for Nonlinear Programming
- A successive quadratic programming algorithm with global and superlinear convergence properties
- 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
- Feasible directions algorithms for optimization problems with equality and inequality constraints
- On the Accurate Identification of Active Constraints
- Engineering and Economic Applications of Complementarity Problems
- A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
- A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- Solving mathematical programs with complementarity constraints as nonlinear programs
- A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
