Add to ORKGCover title.Includes bibliographical references (p. 47-48).Supported through NSF Graduate Research Fellowship.Marina Epelman and Robert M. Freund
For a conic linear system of the form Ax ∈ K, K a convex cone, several condition measures have been...
Abstract in HTML and working paper for download in PDF available via World Wide Web at the Social Sc...
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...
"December 1998."Includes bibliographical references (p. 36-38).by M. Epelman and R. Freund
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...
The analysis of iterative algorithms solving a conic feasibility problem Ay ∈ K, with A a linear map...
The classical perceptron algorithm is an elementary row-action/relaxation algorithm for solving a ho...
The classical perceptron algorithm is an elementary row-action/relaxation algorithm for solving a ho...
For a conic linear system of the form Ax ∈ K, K a convex cone, several condition measures have been ...
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...
Abstract in HTML and working paper for download in PDF available via World Wide Web at the Social Sc...
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...
"December 1998."Includes bibliographical references (p. 36-38).by M. Epelman and R. Freund
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...
The analysis of iterative algorithms solving a conic feasibility problem Ay ∈ K, with A a linear map...
The classical perceptron algorithm is an elementary row-action/relaxation algorithm for solving a ho...
The classical perceptron algorithm is an elementary row-action/relaxation algorithm for solving a ho...
For a conic linear system of the form Ax ∈ K, K a convex cone, several condition measures have been ...
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...
Abstract in HTML and working paper for download in PDF available via World Wide Web at the Social Sc...
The classical perceptron algorithm is an elementary row-action/relaxation algorithm for solving a ho...