This paper presents a variant of logarithmic penalty methods for nonlinear convex programming. If the descent direction is obtained through a classical Newton-type method, the line search is done on a majorant function. Numerical tests show the efficiency of this approach versus classical line searches
We introduce the concept of partially strictly monotone functions and apply it to construct a class ...
In this paper, we propose a line-search procedure for the logarithmic barrier function in the contex...
In Nonlinear Optimization Penalty and Barrier Methods are normally used to solve Constrained Proble...
In this paper, we have reviewed some penalty function methods for solving constrained optimization p...
The study deals with nonlinear programming. The work is aimed at development of rather simple, as re...
Optimization problems arise in science, engineering, economy, etc. and we need to find the best sol...
AbstractWe offer a variant of the piecewise-linear penalty-function approach to linear programming w...
The non-linear programming problem seeks to maximize a function f(x) where the n component vector x ...
Abstract. We consider the following classes of nonlinear programming problems: the minimization of s...
sequential convex programming, penalty method, barrier method, reduced gradient method, interior poi...
Cover title.Includes bibliographical references (p. 29-32).Research partially supported by the U.S. ...
AbstractThe paper describes a hybrid variable penalty method (in which the penalty functions are fin...
© 2019, Allerton Press, Inc. We propose a penalty method for general convex constrained optimization...
AbstractThe purpose of this note is to present a smooth penalty formulation for integer programming....
This paper presents a new penalty function called logarithmic penalty function (LPF) and examines th...
We introduce the concept of partially strictly monotone functions and apply it to construct a class ...
In this paper, we propose a line-search procedure for the logarithmic barrier function in the contex...
In Nonlinear Optimization Penalty and Barrier Methods are normally used to solve Constrained Proble...
In this paper, we have reviewed some penalty function methods for solving constrained optimization p...
The study deals with nonlinear programming. The work is aimed at development of rather simple, as re...
Optimization problems arise in science, engineering, economy, etc. and we need to find the best sol...
AbstractWe offer a variant of the piecewise-linear penalty-function approach to linear programming w...
The non-linear programming problem seeks to maximize a function f(x) where the n component vector x ...
Abstract. We consider the following classes of nonlinear programming problems: the minimization of s...
sequential convex programming, penalty method, barrier method, reduced gradient method, interior poi...
Cover title.Includes bibliographical references (p. 29-32).Research partially supported by the U.S. ...
AbstractThe paper describes a hybrid variable penalty method (in which the penalty functions are fin...
© 2019, Allerton Press, Inc. We propose a penalty method for general convex constrained optimization...
AbstractThe purpose of this note is to present a smooth penalty formulation for integer programming....
This paper presents a new penalty function called logarithmic penalty function (LPF) and examines th...
We introduce the concept of partially strictly monotone functions and apply it to construct a class ...
In this paper, we propose a line-search procedure for the logarithmic barrier function in the contex...
In Nonlinear Optimization Penalty and Barrier Methods are normally used to solve Constrained Proble...
DOI
Add to ORKG