
doi: 10.1007/bf02346160
handle: 11573/247011
We consider a class of non-differentiable penalty functions for the solution of nonlinear programming problems without convexity assumptions. Preliminarily, we introduce a notion of exactness which appears to be of relevance in connection with the solution of the constrained problem by means of unconstrained minimization methods. Then, we show that the class of penalty functions considered is exact, according to this notion.
nondifferentiable penalty functions, Numerical mathematical programming methods, Numerical methods based on nonlinear programming, Nonlinear programming, Optimization; Nonlinear programming; Penalty functions, exactness
nondifferentiable penalty functions, Numerical mathematical programming methods, Numerical methods based on nonlinear programming, Nonlinear programming, Optimization; Nonlinear programming; Penalty functions, exactness
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 41 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
