Add to ORKGWe use quadratic penalty functions along with some recent ideas from linear l1 estimation to arrive at a new characterization of primal optimal solutions in linear programs. The algorithmic implications of this analysis are studied, and a new, finite penalty algorithm for linear programming is designed. Preliminary computational results are presented
AbstractWe offer a variant of the piecewise-linear penalty-function approach to linear programming w...
We consider a class of nondifferentiable penalty functions associated to nonlinear programming probl...
We give a general description of a new advanced implementation of the simplex method for linear prog...
We use quadratic penalty functions along with some recent ideas from linear l1 estimation to arrive ...
This paper takes a fresh look at the application of quadratic penalty functions to linear programmin...
A sequential quadratic programming algorithm for nonlinear programs using an l∞ exact penalty functi...
Abstract. We consider the following classes of nonlinear programming problems: the minimization of s...
AbstractPenalty function methods, presented many years ago, play exceedingly important roles in the ...
In this article, a nonlinear semidefinite program is reformulated into a mathematical program with a...
Cover title.Includes bibliographical references (p. 29-32).Research partially supported by the U.S. ...
A solution procedure for linear programs with one convex quadratic constraint is suggested. The meth...
We present a new algorithm to solve linear programming problems with finite lower and upper bounds....
In this paper, we develop an exterior point algorithm for convex quadratic programming using a penal...
The problem of maximizing a linear function with linear and quadratic constraints is considered. The...
Abstract- Linear programming is the name of a branch of applied mathematics that deals with solving ...
AbstractWe offer a variant of the piecewise-linear penalty-function approach to linear programming w...
We consider a class of nondifferentiable penalty functions associated to nonlinear programming probl...
We give a general description of a new advanced implementation of the simplex method for linear prog...
We use quadratic penalty functions along with some recent ideas from linear l1 estimation to arrive ...
This paper takes a fresh look at the application of quadratic penalty functions to linear programmin...
A sequential quadratic programming algorithm for nonlinear programs using an l∞ exact penalty functi...
Abstract. We consider the following classes of nonlinear programming problems: the minimization of s...
AbstractPenalty function methods, presented many years ago, play exceedingly important roles in the ...
In this article, a nonlinear semidefinite program is reformulated into a mathematical program with a...
Cover title.Includes bibliographical references (p. 29-32).Research partially supported by the U.S. ...
A solution procedure for linear programs with one convex quadratic constraint is suggested. The meth...
We present a new algorithm to solve linear programming problems with finite lower and upper bounds....
In this paper, we develop an exterior point algorithm for convex quadratic programming using a penal...
The problem of maximizing a linear function with linear and quadratic constraints is considered. The...
Abstract- Linear programming is the name of a branch of applied mathematics that deals with solving ...
AbstractWe offer a variant of the piecewise-linear penalty-function approach to linear programming w...
We consider a class of nondifferentiable penalty functions associated to nonlinear programming probl...
We give a general description of a new advanced implementation of the simplex method for linear prog...