Results 141 to 150 of about 13,831 (172)

On differentiable exact penalty functions

Journal of Optimization Theory and Applications, 1986
We study a differentiable exact penalty function for solving twice continuously differentiable inequality constrained optimization problems. Under certain assumptions on the parameters of the penalty function, we show the equivalence of the stationary points of this function and the Kuhn-Tucker points of the restricted problem as well as their extreme ...
Vinante, C., Pintos, S.
openaire   +2 more sources

Second-order conditions for an exact penalty function

Mathematical Programming, 1980
In this paper we give first- and second-order conditions to characterize a local minimizer of an exact penalty function. The form of this characterization gives support to the claim that the exact penalty function and the nonlinear programming problem are closely related.
Thomas F. Coleman, Andrew R. Conn
openaire   +2 more sources

Smoothing Partially Exact Penalty Function of Biconvex Programming

Asia-Pacific Journal of Operational Research, 2020
In this paper, a smoothing partial exact penalty function of biconvex programming is studied. First, concepts of partial KKT point, partial optimum point, partial KKT condition, partial Slater constraint qualification and partial exactness are defined for biconvex programming.
Rui Shen 0001, Zhiqing Meng, Min Jiang
openaire   +1 more source

An exact penalty function for semi-infinite programming

Mathematical Programming, 1987
The authors describe an exact penalty function for nonlinear semi- infinite programming. This function is a generalization of the \(\ell_ 1\) exact penalty function for nonlinear programming and may be used as a merit function for semi-infinite programming methods.
Andrew R. Conn, Nicholas I. M. Gould
openaire   +2 more sources

A sufficient condition for exact penalty functions

Optimization Letters, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

An exact penalty function based on the projection matrix

Applied Mathematics and Computation, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ricardo Luiz Utsch de Freitas Pinto, Ricardo Poley Martins Ferreira   +1 more
openaire   +2 more sources

Exact Penalty Functions for Nondifferentiable Programming Problems

1989
In recent years an increasing attention has been devoted to the use of nondifferentiable exact penalty functions for the solution of nonlinear programming problems. However, as pointed out in [22], virtually all the published literature on exact penalty functions treats one of two cases: either the nonlinear programming problem is a convex problem (see,
DI PILLO, Gianni, FACCHINEI, Francisco
openaire   +2 more sources

Lower order calmness and exact penalty function

Optimization Methods and Software, 2006
In this article, we investigate the exact penalty properties of a lower order penalty function under a lower order calmness conditions. It is shown that the local exact penalization of the lower order penalty function with any positive penalty parameter holds under the local lower order calmness condition.
F. S. Bai, Zhi-You Wu, D. L. Zhu
openaire   +1 more source

Smoothing Approximation to the New Exact Penalty Function with Two Parameters

Asia-Pacific Journal of Operational Research, 2021
In this paper, we propose a new non-smooth penalty function with two parameters for nonlinear inequality constrained optimization problems. And we propose a twice continuously differentiable function which is smoothing approximation to the non-smooth penalty function and define the corresponding smoothed penalty problem.
Jing Qiu, Jiguo Yu, Shujun Lian
openaire   +1 more source

An exact penalty function for nonlinear programming with inequalities

Mathematical Programming, 1973
It is shown how, given a nonlinear programming problem with inequality constraints, it is possible to construct an exact penalty function with a local unconstrained minimum at any local minimum of the constrained problem. The unconstrained minimum is sufficiently smooth to permit conventional optimization techniques to be used to locate it.
openaire   +2 more sources