A globally convergent sequential linear programming algorithm for mathematical programs with linear complementarity constraints
DOI10.1080/02522667.2010.10700008zbMath1220.90121OpenAlexW2098064888MaRDI QIDQ3008599
Publication date: 22 June 2011
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: http://www.connectjournals.com/file_html_pdf/869505H_jios443_1011-1039a.pdf
sequential linear programming algorithmmathematical program with equilibrium constraintsFischer-Burmeister functionallinear parametric complementarity problemrestoration step
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (2)
Cites Work
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Hierarchical optimization: An introduction
- A smoothing method for mathematical programs with equilibrium constraints
- Practical bilevel optimization. Algorithms and applications
- Bilevel and multilevel programming: A bibliography review
- Improved smoothing-type methods for the solution of linear programs
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- On the global convergence of an SLP-filter algorithm that takes EQP steps
- A trust region algorithm for nonlinear bilevel programming
- Global optimization method for solving mathematical programs with linear complementarity constraints
- Global convergence of a class of non-interior point algorithms using Chen-Harker-Kanzow-Smale functions for nonlinear complementarity problems
- On the solution of the extended linear complementarity problem
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints
- Growth behavior of a class of merit functions for the nonlinear complementarity problem
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- On Optimization Problems with Variational Inequality Constraints
- On optimization of systems governed by implicit complementarity problems*
- Engineering and Economic Applications of Complementarity Problems
- Global Methods for Nonlinear Complementarity Problems
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Rate of Convergence of a Class of Methods of Feasible Directions
- Finite-Dimensional Variational Inequalities and Complementarity Problems
This page was built for publication: A globally convergent sequential linear programming algorithm for mathematical programs with linear complementarity constraints
