Results 141 to 150 of about 273,786 (182)

A new class of exact penalty functions and penalty algorithms

Journal of Global Optimization, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Changyu, Ma, Cheng, Zhou, Jinchuan
openaire   +3 more sources

On Smoothing Exact Penalty Functions for Convex Constrained Optimization

SIAM Journal on Optimization, 1994
Summary: A quadratic smoothing approximation to nondifferentiable exact penalty functions for convex constrained optimization is proposed and its properties are established. The smoothing approximation is used as the basis of an algorithm for solving problems with (i) embedded network structures, and (ii) nonlinear minimax problems. Extensive numerical
Pinar, Mustafa Ç., Zenios, Stavros A.
openaire   +3 more sources

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

Optimal Control Problems via Exact Penalty Functions

Journal of Global Optimization, 1998
The paper deals with the problem how some constrained optimization problems (like, for instance, control problems) can be reduced to unconstrained ones by the method called exact penalization. This method needs that a suitable function (nonsmooth functional in general) describing the constrained set in the form of equality satisfies some conditions on ...
Dem'yanov, V. F., Giannessi, F., Karelin, V. V.   +2 more
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.
Shen, Rui, Meng, Zhiqing, Jiang, Min
openaire   +1 more source

A dual differentiable exact penalty function

Mathematical Programming, 1983
A new penalty function is associated with an inequality constrained nonlinear programming problem via its dual. This penalty function is globally differentiable if the functions defining the original problem are twice globally differentiable. In addition, the penalty parameter remains finite.
Han, S.-P., Mangasarian, O. L.
openaire   +2 more sources

Characterizations for perturbed exact penalty functions

Nonlinear Analysis: Theory, Methods & Applications, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, X. Q., Ralph, D.
openaire   +2 more sources

Optimality Conditions via Exact Penalty Functions

SIAM Journal on Optimization, 2010
In this paper, we study KKT optimality conditions for constrained nonlinear programming problems and strong and Mordukhovich stationarities for mathematical programs with complementarity constraints using $l_p$ penalty functions, with $0\leq p\leq1$. We introduce some optimality indication sets by using contingent derivatives of penalty function terms.
Meng, K, Yang, XQ
openaire   +2 more sources

Exact penalty functions in isoperimetric problems

Optimization, 2011
It was earlier demonstrated, by the so-called main (or simplest) problem of the Calculus of Variations, that the Theory of Exact Penalties allows one not only to derive fundamental results of the Calculus of Variations but also to construct new direct numerical methods for solving variational problems based on the notions of subgradient and ...
V.F. Demyanov, G.Sh. Tamasyan
openaire   +1 more source

Exact penalty functions for generalized Nash problems

2006
We propose the use exact penalty functions for the solution of generalized Nash equilibrium problems (GNEPs). We show that by this approach it is possible to reduce the solution of a GNEP to that of a usual Nash problem. This paves the way to the development of numerical methods for the solution of GNEPs.
FACCHINEI, Francisco, PANG J. S. .
openaire   +2 more sources