A globally convergent primal-dual interior point algorithm for convex programming
type: Item
instance of: scholarly article
title: A globally convergent primal-dual interior point algorithm for convex programming
zbMATH Open document ID: 0820.90086
DOI: 10.1007/BF01582568
published in: Mathematical Programming. Series A. Series B
publication date: 1994-08-10T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 617334
zbMATH Keywords: interior-point methods
zbMATH Keywords: Karmarkar's algorithm
zbMATH Keywords: potential reduction algorithms
zbMATH Keywords: global convergence
zbMATH Keywords: primal-dual interior point algorithms
zbMATH Keywords: linearly constrained convex programming
zbMATH Keywords: Armijo stepsize rule
zbMATH Keywords: convergence analysis
author: Renato D. C. Monteiro
MaRDI profile type: Publication
cites work: Q3690580
cites work: Dual to primal conversion in geometric programming
cites work: Q5583564
cites work: Global convergence of Rosen's gradient projection method
cites work: Q4226179
cites work: Q3033554
cites work: Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems
cites work: On the classical logarithmic barrier function method for a class of smooth convex programming problems
cites work: A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
cites work: Q5202850
cites work: A new polynomial-time algorithm for linear programming
cites work: Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
cites work: Homotopy Continuation Methods for Nonlinear Complementarity Problems
cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary
cites work: Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
cites work: A polynomial-time algorithm for a class of linear complementarity problems
cites work: Q3491304
cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
cites work: On some efficient interior point methods for nonlinear convex programming
cites work: A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems
cites work: Q3965924
cites work: Q4206561
cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
cites work: PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS
cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming
cites work: Interior path following primal-dual algorithms. I: Linear programming
cites work: An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
cites work: A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
cites work: Classes of functions and feasibility conditions in nonlinear complementarity problems
cites work: Q3809587
cites work: Iterative Descent Algorithms for a Row Sufficient Linear Complementarity Problem
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: Convex Analysis
cites work: Q3804467
cites work: A Centered Projective Algorithm for Linear Programming
cites work: Global linear convergence of a path-following algorithm for some monotone variational inequality problems
cites work: An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming
cites work: A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems
cites work: A path following algorithm for a class of convex programming problems
description: scientific article; zbMATH DE number 617334