Potential reduction method for harmonically convex programming
type: Item
instance of: scholarly article
title: Potential reduction method for harmonically convex programming
zbMATH Open document ID: 0827.90115
DOI: 10.1007/BF02191742
published in: Journal of Optimization Theory and Applications
publication date: 1995-12-13T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 770103
zbMATH Keywords: harmonic convexity
zbMATH Keywords: polynomiality
zbMATH Keywords: potential reduction method
zbMATH Keywords: \(\varepsilon\)-optimal solution
author: Jos F. Sturm
author: Shuzhong Zhang
MaRDI profile type: Publication
cites work: Q5540119
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: Q4735039
cites work: Interior-point methods for convex programming
cites work: Q3827797
cites work: Q4296156
cites work: A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
cites work: A new polynomial-time algorithm for linear programming
cites work: Conical projection algorithms for linear programming
cites work: A multiplicative barrier function method for linear programming
cites work: A proof of the polynomiality of the Iri-Imai method
cites work: Convergence property of the Iri-Imai algorithm for some smooth convex programming problems
cites work: Interior point algorithms for linear programming with inequality constraints
cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming
cites work: Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
cites work: An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
description: scientific article; zbMATH DE number 770103