Add to ORKGCover title.Includes bibliographical references (p. 29-32).Research partially supported by the U.S. Army Research Office (Center for Intelligent Control Systems) DAAL03-86-K-0171by Paul Tseng
Several path following algorithms based on the combination of three smooth penalty functions, the qu...
The global convergence properties of a class of penalty methods for nonlinear pro-gramming are analy...
In this paper, we develop an exterior point algorithm for convex quadratic programming using a penal...
This paper takes a fresh look at the application of quadratic penalty functions to linear programmin...
Caption title. "September 1988."Includes bibliographical references.This research is partially suppo...
A new algorithm for the ℓ∞ solution of overdetermined linear systems is given. The algorithm is base...
We use quadratic penalty functions along with some recent ideas from linear l1 estimation to arrive ...
AbstractWe propose a new polynomial potential-reduction method for linear programming, which can als...
In this paper, we develop an exterior point algorithm for convex quadratic programming using a penal...
This paper presents a variant of logarithmic penalty methods for nonlinear convex programming. If th...
Recent efforts in differentiable non-linear programming have been focused on interior point methods,...
AbstractRecent efforts in differentiable non-linear programming have been focused on interior point ...
Caption title.Includes bibliographical references.This research is partially supported by the U.S. A...
This paper presents a new penalty function called logarithmic penalty function (LPF) and examines th...
We consider the construction of small step path following algorithms using volumetric, and mixed vol...
Several path following algorithms based on the combination of three smooth penalty functions, the qu...
The global convergence properties of a class of penalty methods for nonlinear pro-gramming are analy...
In this paper, we develop an exterior point algorithm for convex quadratic programming using a penal...
This paper takes a fresh look at the application of quadratic penalty functions to linear programmin...
Caption title. "September 1988."Includes bibliographical references.This research is partially suppo...
A new algorithm for the ℓ∞ solution of overdetermined linear systems is given. The algorithm is base...
We use quadratic penalty functions along with some recent ideas from linear l1 estimation to arrive ...
AbstractWe propose a new polynomial potential-reduction method for linear programming, which can als...
In this paper, we develop an exterior point algorithm for convex quadratic programming using a penal...
This paper presents a variant of logarithmic penalty methods for nonlinear convex programming. If th...
Recent efforts in differentiable non-linear programming have been focused on interior point methods,...
AbstractRecent efforts in differentiable non-linear programming have been focused on interior point ...
Caption title.Includes bibliographical references.This research is partially supported by the U.S. A...
This paper presents a new penalty function called logarithmic penalty function (LPF) and examines th...
We consider the construction of small step path following algorithms using volumetric, and mixed vol...
Several path following algorithms based on the combination of three smooth penalty functions, the qu...
The global convergence properties of a class of penalty methods for nonlinear pro-gramming are analy...
In this paper, we develop an exterior point algorithm for convex quadratic programming using a penal...