Decomposition and Nondifferentiable Optimization with the Projective Algorithm
Data up to Jan 2025
Total Citations Per Year
Abstract
References (15)
A new polynomial-time algorithm for linear programming
1984 • 4,898 citations
The Decomposition Algorithm for Linear Programs
1961 • 754 citations
Pathways to the Optimal Set in Linear Programming
1989 • 585 citations
Nondifferentiable Optimization
2011 • 430 citations
Methods of Descent for Nondifferentiable Optimization
1985 • 398 citations
Two-Metric Projection Methods for Constrained Optimization
1984 • 235 citations
A polynomial newton method for linear programming
1986 • 138 citations
Robust min–max portfolio strategies for rival forecast and risk scenarios
2000 • 82 citations
New Algorithms in Convex Programming Based on a Notion of “Centre” (for Systems of Analytic Inequalities) and on Rational Extrapolation
1988 • 74 citations
Cutting planes and column generation techniques with the projective algorithm
1990 • 67 citations
On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
1993 • 59 citations
On the convexity of the multiplicative version of Karmarkar's potential function
1988 • 24 citations
Karmarkar's algorithm and combinatorial optimization problems
1988 • 18 citations
A unified approach to projective algorithms for linear programming
2006 • 11 citations
Deleted Work
1955 • 0 citations