An interior point potential reduction method for constrained equations
From MaRDI portal
Publication:1814789
DOI10.1007/BF02592210zbMath0855.90128OpenAlexW2070686189MaRDI QIDQ1814789
Jong-Shi Pang, Tao Wang, Renato D. C. Monteiro
Publication date: 24 November 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02592210
convergence analysisvariational inequalitiescomplementarity problemsdamped Newton methodconstrained system of nonlinear equationsinterior point potential reduction methods
Nonlinear programming (90C30) Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Multivariate Encryption Schemes Based on Polynomial Equations over Real Numbers, Inexact interior-point method, On affine-scaling inexact dogleg methods for bound-constrained nonlinear systems, Constrained dogleg methods for nonlinear systems with simple bounds, A non-interior implicit smoothing approach to complementarity problems for frictionless contacts, An inexact derivative-free Levenberg-Marquardt method for linear inequality constrained nonlinear systems under local error bound conditions, An interior global method for nonlinear systems with simple bounds, Formulation and comparison of algorithms for frictional contact problems, Levenberg-Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints, Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints, Tensor complementarity problems. II: Solution methods, A Smoothing Projected Levenberg-Marquardt Type Algorithm for Solving Constrained Equations, The reformulation of nonlinear complementarity problems using the Fischer-Burmeister function, Feasible direction interior-point technique for nonlinear optimization, A potential reduction method for tensor complementarity problems, Utility based option pricing with proportional transaction costs and diversification problems: An interior-point optimization approach, An SQP method for general nonlinear complementarity problems, An affine scaling trust-region approach to bound-constrained nonlinear systems, Globalization technique for projected Newton–Krylov methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- Feasibility issues in a primal-dual interior-point method for linear programming
- Computational experience with a primal-dual interior point method for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- Test examples for nonlinear programming codes
- A class of linear complementarity problems solvable in polynomial time
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- An interior point potential reduction algorithm for the linear complementarity problem
- A primal-dual infeasible-interior-point algorithm for linear programming
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- A globally convergent primal-dual interior point algorithm for convex programming
- Global convergence in infeasible-interior-point algorithms
- Interior-point methods for nonlinear complementarity problems
- A Centered Projective Algorithm for Linear Programming
- An Algorithm for Large-Scale Quadratic Programming
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
- Homotopy Continuation Methods for Nonlinear Complementarity Problems
- Path-Following Methods for Linear Programming
- A set of geometric programming test problems and their solutions
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Commentary—Theory and Practice for Interior-Point Methods
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
- Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem
- A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
- On Dynamic Multi‐Rigid‐Body Contact Problems with Coulomb Friction
- Properties of an Interior-Point Mapping for Mixed Complementarity Problems
- Symmetric Quasidefinite Matrices
- A Positive Algorithm for the Nonlinear Complementarity Problem
- The Extended Linear Complementarity Problem
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
- On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems
- A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem
- Convex Analysis
