A new SQP approach for nonlinear complementarity problems
DOI10.1080/00207160701798780zbMath1171.65046OpenAlexW2081101031WikidataQ57806690 ScholiaQ57806690MaRDI QIDQ5190727
No author found.
Publication date: 27 July 2009
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160701798780
global convergencenumerical examplesnonlinear programmingnonlinear complementarity problemsSQP methodssequential quadratic programming methods
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Methods of successive quadratic programming type (90C55)
Related Items
Cites Work
- Unnamed Item
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- A smoothing Broyden-like method for the mixed complementarity problems
- Sequential penalty quadratic programming filter methods for nonlinear programming
- On the resolution of monotone complementarity problems
- On the convergence of a new trust region algorithm
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- A new penalty method for nonlinear programming
- An SQP approach with line search for a system of nonlinear equations
- A filter method for solving nonlinear complementarity problems
- A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
- A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
- A Feasible Trust-Region Sequential Quadratic Programming Algorithm
- Global Methods for Nonlinear Complementarity Problems
- On the Global Convergence of a Filter--SQP Algorithm
- A new smoothing quasi-Newton method for nonlinear complementarity problems
