Global convergence in infeasible-interior-point algorithms
From MaRDI portal
Publication:1334952
DOI10.1007/BF01581689zbMath0820.90106OpenAlexW2079401288MaRDI QIDQ1334952
Toshihito Noma, Akiko Yoshise, Kojima, Masakazu
Publication date: 26 September 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581689
global convergencenonlinear complementarityconstrained potential reduction modelcontinuously differentiable monotone mappingglobally convergent interior-point algorithms
Related Items
An infeasible interior-point algorithm for solving primal and dual geometric programs, Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems, Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs, New infeasible interior-point algorithm based on monomial method, Inexact interior-point method, A non-interior implicit smoothing approach to complementarity problems for frictionless contacts, A potential-reduction algorithm for linear complementarity problems, On the Newton interior-point method for nonlinear programming problems, Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications, Tensor complementarity problems. II: Solution methods, An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps, An interior point potential reduction method for constrained equations, A potential reduction method for tensor complementarity problems, Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones, Weakening convergence conditions of a potential reduction method for tensor complementarity problems, An inexact interior point method for monotone NCP, Global convergence enhancement of classical linesearch interior point methods for MCPs, Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A little theorem of the big \({\mathcal M}\) in interior point algorithms
- A new polynomial-time algorithm for linear programming
- Feasibility issues in a primal-dual interior-point method for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A polynomial-time algorithm for a class of linear complementarity problems
- 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 primal-dual affine-scaling potential-reduction algorithm for linear programming
- Interior-point methods for nonlinear complementarity problems
- A Centered Projective Algorithm for Linear Programming
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- Homotopy Continuation Methods for Nonlinear Complementarity Problems
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Classes of functions and feasibility conditions in nonlinear complementarity problems
- A monotone complementarity problem with feasible solutions but no complementary solutions
- A General Framework of Continuation Methods for Complementarity Problems
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- Note on a Fundamental Theorem in Quadratic Programming
