NE/SQP: A robust algorithm for the nonlinear complementarity problem
From MaRDI portal
Publication:689133
DOI10.1007/BF01580617zbMath0808.90123MaRDI QIDQ689133
Jong-Shi Pang, Steven A. Gabriel
Publication date: 15 March 1995
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
90C20: Quadratic programming
49J40: Variational inequalities
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
On the convergence of combined relaxation methods for variational inequalties, Inverse and implicit function theorems forH-differentiable and semismooth functions, A numerical embedding method for solving the nonlinear optimization problem, Iterative method with modification of the right-hand side vector for nonlinear complementarity problems, A new homotopy method for solving non-linear complementarity problems, A new version of extragradient method for variational inequality problems, Unified framework of extragradient-type methods for pseudomonotone variational inequalities., Modified extragradient method for variational inequalities and verification of solution existence, A new path-following algorithm for nonlinear \(P_*\) complementarity problems, New constrained optimization reformulation of complementarity problems, An NE/SQP method for the bounded nonlinear complementarity problem, A superlinearly convergent projection algorithm for solving the convex inequality problem, Elastoplastic analysis of structures with nonlinear hardening: A nonlinear complementarity approach, Nonlinear complementarity as unconstrained and constrained minimization, A degree-theoretic approach to parametric nonsmooth equations with multivalued perturbed solution sets, A parameterized Newton method and a quasi-Newton method for nonsmooth equations, Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems, A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems, Solution of monotone complementarity problems with locally Lipschitzian functions, QPCOMP: A quadratic programming based solver for mixed complementarity problems, On unconstrained and constrained stationary points of the implicit Lagrangian, Error bounds in mathematical programming, Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems, Stationary points of bound constrained minimization reformulations of complementarity problems, Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function, A positive interior-point algorithm for nonlinear complementarity problems., An SQP method for general nonlinear complementarity problems, On minimizing and stationary sequences of a new class of merit functions for nonlinear complementarity problems, A class of smoothing functions for nonlinear and mixed complementarity problems, On the resolution of monotone complementarity problems, On the equivalence of linear complementarity problems, A globally convergent Newton method for convex \(SC^ 1\) minimization problems, Inexact Newton methods for solving nonsmooth equations, A continuation method for monotone variational inequalities, A pathsearch damped Newton method for computing general equilibria, The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function, The Lagrangian globalization method for nonsmooth constrained equations, A smoothing Levenberg-Marquardt method for NCP, A new double projection algorithm for variational inequalities, A filter method for solving nonlinear complementarity problems, A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*, Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mathematical foundations of nonsmooth embedding methods
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- A variable dimension solution approach for the general spatial price equilibrium problem
- A multi-grid continuation strategy for parameter-dependent variational inequalities
- Continuation for parametrized nonlinear variational inequalities
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- An inexact NE/SQP method for solving the nonlinear complementarity problem
- Local convergence of quasi-Newton methods for B-differentiable equations
- A method for the analysis of equilibrium multipart prices in oligopolistic markets
- Nonmonotone stabilization methods for nonlinear equations
- Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results
- Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities
- A robust sequential quadratic programming method
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- A globally convergent Newton method for solving strongly monotone variational inequalities
- Iterative Methods for Large Convex Quadratic Programs: A Survey
- Nonsmooth Equations: Motivation and Algorithms
- Newton's Method for B-Differentiable Equations
- Linearized simplicial decomposition methods for computing traffic equilibria on networks
- Elasto-hydrodynamic lubrication: A non-linear complementarity problem
- Product Positioning Under Price Competition
- Alternative algorithms for computing economic equilibria
- Sequential optimization and complementarity techniques for computing economic equilibria
- Computational Experience in Solving Equilibrium Models by a Sequence of Linear Complementarity Problems
- EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
- A Gauss-Newton Approach to Solving Generalized Inequalities
- Strongly Regular Generalized Equations
- Projection methods for variational inequalities with application to the traffic assignment problem
- A mathematical programming approach for determining oligopolistic market equilibrium
- Computing an Optimal Invariant Capital Stock
- Equilibria on a Congested Transportation Network
- Minimization of Locally Lipschitzian Functions
- Globally Convergent Newton Methods for Nonsmooth Equations
- Solving generalized equations via homotopies
- An algorithm based on a sequence of linear complementarity problems applied to a walrasian equilibrium model: An example