This paper presents an algorithm model for the analysis of penalty functions type algorithms. Two optimization procedures are studied using the model. The first one is the classical exterior penalty functions method and the second one is a conceptual algorithm for solving nonlinear programming problems
International audienceThis paper presents an analysis of the involvement of the penalty parameter in...
Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground i...
In this paper formal definitions of exactness for penalty functions are introduced and sufficient co...
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...
Abstract. We consider the following classes of nonlinear programming problems: the minimization of s...
A sequential quadratic programming algorithm for nonlinear programs using an l∞ exact penalty functi...
We introduce the concept of partially strictly monotone functions and apply it to construct a class ...
The most common approach for solving constrained optimization problems is based on penalty functions...
The non-linear programming problem seeks to maximize a function f(x) where the n component vector x ...
This thesis deals with one of the possible different approaches to solving nonlinear optimization pr...
We consider a class of nondifferentiable penalty functions associated to nonlinear programming probl...
This paper presents a variant of logarithmic penalty methods for nonlinear convex programming. If th...
This paper presents an analysis of the involvement of the penalty parameter in exact penalty functio...
We use quadratic penalty functions along with some recent ideas from linear l1 estimation to arrive ...
International audienceThis paper presents an analysis of the involvement of the penalty parameter in...
Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground i...
In this paper formal definitions of exactness for penalty functions are introduced and sufficient co...
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...
Abstract. We consider the following classes of nonlinear programming problems: the minimization of s...
A sequential quadratic programming algorithm for nonlinear programs using an l∞ exact penalty functi...
We introduce the concept of partially strictly monotone functions and apply it to construct a class ...
The most common approach for solving constrained optimization problems is based on penalty functions...
The non-linear programming problem seeks to maximize a function f(x) where the n component vector x ...
This thesis deals with one of the possible different approaches to solving nonlinear optimization pr...
We consider a class of nondifferentiable penalty functions associated to nonlinear programming probl...
This paper presents a variant of logarithmic penalty methods for nonlinear convex programming. If th...
This paper presents an analysis of the involvement of the penalty parameter in exact penalty functio...
We use quadratic penalty functions along with some recent ideas from linear l1 estimation to arrive ...
International audienceThis paper presents an analysis of the involvement of the penalty parameter in...
Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground i...
In this paper formal definitions of exactness for penalty functions are introduced and sufficient co...
DOI
Add to ORKG