A global QP-free algorithm for mathematical programs with complementarity constraints
DOI10.1186/S13660-020-02479-6zbMATH Open1503.90132OpenAlexW3081642540MaRDI QIDQ2069554FDOQ2069554
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
Recommendations
- A strong global convergent QP-free algorithm for mathematical programming with nonlinear complementary constraints
- A new QP-free algorithm for mathematical programs with nonlinear complementarity constraints
- A globally convergent QP-free algorithm for optimization with nonlinear complementarity constraints
- A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints
- A globally convergent SQP algorithm for mathematical programs with nonlinear complementarity constraints
Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- Foundations of bilevel programming
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- On the Accurate Identification of Active Constraints
- Engineering and Economic Applications of Complementarity Problems
- Solving mathematical programs with complementarity constraints as nonlinear programs
- 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 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
- A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
- Title not available (Why is that?)
- A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- 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 SSLE algorithm for optimization problems with linear complementarity constraints
- A Feasible Active Set QP-Free Method for Nonlinear Programming
- Feasible directions algorithms for optimization problems with equality and inequality constraints
- A successive quadratic programming algorithm with global and superlinear convergence properties
- A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
- A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
- Title not available (Why is that?)
- 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 new filter QP-free method for the nonlinear inequality constrained optimization problem
- Title not available (Why is that?)
- Primal-dual interior point QP-free algorithm for nonlinear constrained optimization
Cited In (1)
Uses Software
This page was built for publication: A global QP-free algorithm for mathematical programs with complementarity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2069554)
