Add to ORKG"December 1998."Includes bibliographical references (p. 36-38).by M. Epelman and R. Freund
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 2002.Includes bi...
For a conic linear system of the form Ax ∈ K, K a convex cone, several condition measures have been...
The classical perceptron algorithm is an elementary row-action/relaxation algorithm for solving a ho...
Cover title.Includes bibliographical references (p. 47-48).Supported through NSF Graduate Research F...
We develop an algorithm for resolving a conic linear system (FPd), which is a system of the form (FP...
In this paper we present two algorithms for computing estimates of condition measures for a convex f...
"September 1997."Includes bibliographical references (p. 28-29).by R.M. Freund and J.R. Vera
Abstract. The analysis of iterative algorithms solving a conic feasi-bility problem Ay ∈ K, with A a...
For a conic linear system of the form Ax ∈ K, K a convex cone, several condition measures have been ...
In recent years, new and powerful research into "condition numbers" for convex optimization has been...
A conic linear system is a system of the form P: find x that solves b- Ax E Cy, E Cx, where Cx and C...
The classical perceptron algorithm is an elementary row-action/relaxation algorithm for solving a ho...
The analysis of iterative algorithms solving a conic feasibility problem Ay ∈ K, with A a linear map...
For a conic linear system of the form Ax ∈ K, K a convex cone, several condition measures have been ...
The classical perceptron algorithm is an elementary row-action/relaxation algorithm for solving a ho...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 2002.Includes bi...
For a conic linear system of the form Ax ∈ K, K a convex cone, several condition measures have been...
The classical perceptron algorithm is an elementary row-action/relaxation algorithm for solving a ho...
Cover title.Includes bibliographical references (p. 47-48).Supported through NSF Graduate Research F...
We develop an algorithm for resolving a conic linear system (FPd), which is a system of the form (FP...
In this paper we present two algorithms for computing estimates of condition measures for a convex f...
"September 1997."Includes bibliographical references (p. 28-29).by R.M. Freund and J.R. Vera
Abstract. The analysis of iterative algorithms solving a conic feasi-bility problem Ay ∈ K, with A a...
For a conic linear system of the form Ax ∈ K, K a convex cone, several condition measures have been ...
In recent years, new and powerful research into "condition numbers" for convex optimization has been...
A conic linear system is a system of the form P: find x that solves b- Ax E Cy, E Cx, where Cx and C...
The classical perceptron algorithm is an elementary row-action/relaxation algorithm for solving a ho...
The analysis of iterative algorithms solving a conic feasibility problem Ay ∈ K, with A a linear map...
For a conic linear system of the form Ax ∈ K, K a convex cone, several condition measures have been ...
The classical perceptron algorithm is an elementary row-action/relaxation algorithm for solving a ho...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 2002.Includes bi...
For a conic linear system of the form Ax ∈ K, K a convex cone, several condition measures have been...
The classical perceptron algorithm is an elementary row-action/relaxation algorithm for solving a ho...