NE/SQP: A robust algorithm for the nonlinear complementarity problem
From MaRDI portal
Publication:689133
DOI10.1007/BF01580617zbMATH Open0808.90123OpenAlexW2050864977MaRDI QIDQ689133FDOQ689133
Authors: Jong-Shi Pang, Steven A. Gabriel 
Publication date: 15 March 1995
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580617
Recommendations
- An NE/SQP method for the bounded nonlinear complementarity problem
- Gauss-Newton methods for the complementarity problem
- An inexact NE/SQP method for solving the nonlinear complementarity problem
- An SQP method for general nonlinear complementarity problems
- A Positive Algorithm for the Nonlinear Complementarity Problem
Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Variational inequalities (49J40)
Cites Work
- Title not available (Why is that?)
- Optimization and nonsmooth analysis
- Strongly Regular Generalized Equations
- Projection methods for variational inequalities with application to the traffic assignment problem
- Title not available (Why is that?)
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Title not available (Why is that?)
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Newton's Method for B-Differentiable Equations
- Elasto-hydrodynamic lubrication: A non-linear complementarity problem
- Equilibria on a Congested Transportation Network
- Linearized simplicial decomposition methods for computing traffic equilibria on networks
- A mathematical programming approach for determining oligopolistic market equilibrium
- Title not available (Why is that?)
- An algorithm based on a sequence of linear complementarity problems applied to a walrasian equilibrium model: An example
- An inexact NE/SQP method for solving the nonlinear complementarity problem
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities
- A robust sequential quadratic programming method
- Nonsmooth Equations: Motivation and Algorithms
- A Gauss-Newton Approach to Solving Generalized Inequalities
- A globally convergent Newton method for solving strongly monotone variational inequalities
- Minimization of Locally Lipschitzian Functions
- EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- A method for the analysis of equilibrium multipart prices in oligopolistic markets
- Iterative Methods for Large Convex Quadratic Programs: A Survey
- Local convergence of quasi-Newton methods for B-differentiable equations
- Globally Convergent Newton Methods for Nonsmooth Equations
- Nonmonotone stabilization methods for nonlinear equations
- Continuation for parametrized nonlinear variational inequalities
- Sequential optimization and complementarity techniques for computing economic equilibria
- A variable dimension solution approach for the general spatial price equilibrium problem
- A multi-grid continuation strategy for parameter-dependent variational inequalities
- Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results
- Product Positioning Under Price Competition
- Alternative algorithms for computing economic equilibria
- Computational Experience in Solving Equilibrium Models by a Sequence of Linear Complementarity Problems
- Computing an Optimal Invariant Capital Stock
- Title not available (Why is that?)
- Solving generalized equations via homotopies
- Title not available (Why is that?)
- Mathematical foundations of nonsmooth embedding methods
Cited In (99)
- A double nonmonotone quasi-Newton method for nonlinear complementarity problem based on piecewise NCP functions
- An SQP method for general nonlinear complementarity problems
- Inverse and implicit function theorems forH-differentiable and semismooth functions
- A pathsearch damped Newton method for computing general equilibria
- Stationary points of bound constrained minimization reformulations of complementarity problems
- Numerical comparisons of two effective methods for mixed complementarity problems
- A smoothing Levenberg-Marquardt method for NCP
- Nonlinear complementarity as unconstrained and constrained minimization
- A partially smoothing Jacobian method for nonlinear complementarity problems with \(P_0\) function
- On regularity conditions for complementarity problems
- Smoothing Newton method for solving two- and three-dimensional frictional contact problems
- Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems
- New effective projection method for variational inequalities problem
- A new active-set strategy for NCP with degenerate solutions
- Modified extragradient method for variational inequalities and verification of solution existence
- Modified Tseng's extragradient algorithms for variational inequality problems
- On the convergence of combined relaxation methods for variational inequalties
- Strong convergence of extragradient methods with a new step size for solving variational inequality problems
- A new smoothing method for solving nonlinear complementarity problems
- Extragradient methods for solving non-Lipschitzian pseudo-monotone variational inequalities
- On the equivalence of linear complementarity problems
- A new path-following algorithm for nonlinear \(P_*\) complementarity problems
- Projected reflected gradient methods for monotone variational inequalities
- New constrained optimization reformulation of complementarity problems
- A superlinearly convergent projection algorithm for solving the convex inequality problem
- Equilibration techniques for solving contact problems with Coulomb friction
- Elastoplastic analysis of structures with nonlinear hardening: A nonlinear complementarity approach
- Nonlinear complementarity functions for plasticity problems with frictional contact
- The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function
- Error bounds in mathematical programming
- Smoothing Newton method for NCP with the identification of degenerate indices
- A new smoothing and regularization Newton method for \(P_{0}\)-NCP
- A tri-dimensional filter SQP algorithm for variational inequality problems
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
- A filter method for solving nonlinear complementarity problems
- A rolling horizon approach for stochastic mixed complementarity problems with endogenous learning: application to natural gas markets
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- On minimizing and stationary sequences of a new class of merit functions for nonlinear complementarity problems
- Modified modulus-based matrix splitting algorithms for a class of weakly nondifferentiable nonlinear complementarity problems
- A nonsmooth inexact Newton method for the solution of large-scale nonlinear 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 class of smoothing functions for nonlinear and mixed complementarity problems
- On the resolution of monotone complementarity problems
- A regularized smoothing Newton method for solving SOCCPs based on a new smoothing C-function
- A degree-theoretic approach to parametric nonsmooth equations with multivalued perturbed solution sets
- A globally convergent Newton method for convex \(SC^ 1\) minimization problems
- Inexact Newton methods for solving nonsmooth equations
- A cosh-based smoothing Newton method for \(P_{0}\) nonlinear complementarity problem
- A new double projection algorithm for variational inequalities
- Smoothing Levenberg-Marquardt method for general nonlinear complementarity problems under local error bound
- A smoothing inexact Newton method for \(P_0\) nonlinear complementarity problem
- Two-level additive Schwarz algorithms for nonlinear complementarity problem with anM-function
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function
- A parameterized Newton method and a quasi-Newton method for nonsmooth equations
- A continuation method for monotone variational inequalities
- On the computation of an element of Clarke generalized Jacobian for a vector-valued max function
- Trust-region method for box-constrained semismooth equations and its applications to complementary problems
- New double projection algorithm for solving variational inequalities
- A family of new smoothing functions and~a~nonmonotone smoothing Newton method for the nonlinear complementarity problems
- Complementarity problems over symmetric cones: A survey of recent developments in several aspects
- On unconstrained and constrained stationary points of the implicit Lagrangian
- The Lagrangian globalization method for nonsmooth constrained equations
- A new smoothing Broyden-like method for solving nonlinear complementarity problem with a \(P_{0}\)-function
- An NE/SQP method for the bounded nonlinear complementarity problem
- QPCOMP: A quadratic programming based solver for mixed complementarity problems
- A positive interior-point algorithm for nonlinear complementarity problems.
- An inexact NE/SQP method for solving the nonlinear complementarity problem
- A new version of extragradient method for variational inequality problems
- Unified framework of extragradient-type methods for pseudomonotone variational inequalities.
- Weak and strong convergence theorems for variational inequality problems
- Variationally consistent discretization schemes and numerical algorithms for contact problems
- A new extragradient-like method for solving variational inequality problems
- A vector forward mode of automatic differentiation for generalized derivative evaluation
- A new proof for global convergence of a smoothing homotopy method for the nonlinear complementarity problem
- Iterative method with modification of the right-hand side vector for nonlinear complementarity problems
- A residual algorithm for finding a fixed point of a nonexpansive mapping
- A projected extrapolated gradient method with larger step size for monotone variational inequalities
- A smoothing homotopy method for variational inequality problems on polyhedral convex sets
- Smoothing SQP algorithm for semismooth equations with box constraints
- A projected derivative-free algorithm for nonlinear equations with convex constraints
- A Gauss-Seidel type method for dynamic nonlinear complementarity problems
- A new class of smoothing functions and a smoothing Newton method for complementarity problems
- An inertial projection and contraction method with a line search technique for variational inequality and fixed point problems
- A new SQP approach for nonlinear complementarity problems
- The modulus-based matrix splitting algorithms for a class of weakly nonlinear complementarity problems.
- A globally convergent BFGS method for pseudo-monotone variational inequality problems
- A modified Broyden-like method for nonlinear complementarity problems
- A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps
- An \((m+1)\)-step iterative method of convergence order \((m+2)\) for linear complementarity problems. An \((m+1)\)-step iterative method for LCPs
- Modified Popov's explicit iterative algorithms for solving pseudomonotone equilibrium problems
- On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators
- An alternated inertial method for pseudomonotone variational inequalities in Hilbert spaces
- A half-space projection algorithm for solving variational inequalities without monotonicity
- A new homotopy method for solving non-linear complementarity problems
- A numerical embedding method for solving the nonlinear optimization problem
- A new descent method for symmetric non-monotone variational inequalities with application to eigenvalue complementarity problems
- A new semismooth Newton method for NCPs based on the penalized KK function
Uses Software
This page was built for publication: NE/SQP: A robust algorithm for the nonlinear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689133)
