Condition-Based Complexity Of Convex Optimization In Conic Linear Form Via The Ellipsoid Algorithm

Condition-Based Complexity Of Convex Optimization In Conic Linear Form Via The Ellipsoid Algorithm (1998)

Cached

Download Links

by Robert M. Freund , Jorge R. Vera

Citations:

BibTeX

@MISC{Freund98condition-basedcomplexity,
    author = {Robert M. Freund and Jorge R. Vera},
    title = {Condition-Based Complexity Of Convex Optimization In Conic Linear Form Via The Ellipsoid Algorithm},
    year = {1998}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

A convex optimization problem in conic linear form is an optimization problem of the form CP (d) : maximize c T

Citations

581	S: Semidefinite programming - Vandenberghe, Boyd - 1996
560	Nonlinear Programming: Theory and Algorithms - Bazaraa, Sherali, et al. - 1993
422	Interior-point methods in semidefinite programming with applications to combinatorial optimization - Alizadeh - 1995
306	A polynomial algorithm in linear programming, Doklady Akad - Khachiyan - 1979
284	The ellipsoid method and its consequences in combinatorial optimization - GRÖTSCHEL, LOVÁSZ, et al. - 1981
253	Introduction to Linear Optimization, Athena Scientific - BERTSIMAS, TSITSIKLIS - 1997
152	Primal–dual interior–point methods for self–scaled cones - Nesterov, Todd - 1998
143	Self-scaled barriers and interior-point methods for convex programming - Nesterov, Todd - 1997
111	A new algorithm for minimizing convex functions over convex sets - Vaidya - 1996
68	Linear programming, complexity theory and elementary functional analysis - Renegar - 1995
59	Some perturbation theory for linear programming - Renegar - 1994
45	The ellipsoid method: A survey - Bland, Goldfarb, et al. - 1981
36	Some characterizations and properties of the “distance to illposedness” and the condition measure of a conic linear system - Freund, Vera - 1999
33	Incorporating condition measures into the complexity theory of linear programming - Renegar - 1995
26	Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems - Nesterov, Todd, et al. - 1999
24	Ill-posedness and the complexity of deciding existence of solutions to linear programs - Vera - 1996
23	The method of inscribed ellipsoids - Tarasov, Khachiyan, et al. - 1988
20	Cut-off method with space extension in convex programming problems - Shor - 1977
18	Condition numbers, the barrier method, and the conjugate gradient method - Renegar - 1996
18	On the complexity of linear programming under finite precision arithmetic - Vera - 1998
16	Some characterizations and properties of the "distance to ill-posedness" and the condition measure of a conic linear system - Freund, Vera - 1999
11	On an algorithm for the minimization of convex functions - Levin - 1965
9	A unifying geometric solution framework and complexity analysis for variational inequalities - Magnanti, Perakis - 1995
5	The dual of a fractional linear program - Craven, Mond - 1973
5	Informational complexity and efficient methods for solving complex extremal problems. Ekonomika i Matem - Yudin, Nemirovskii - 1976
4	Programming with linear fractional - Charnes, Cooper - 1962