
doi: 10.1007/bf01070592
Summary: A method is developed for the minimization of exact penalty functions that does not require solving linear or quadratic programming problems. A fairly general procedure for analyzing the rate of convergence of exact penalty methods is proposed.
exact penalty functions, Numerical mathematical programming methods, Nonlinear programming, Other numerical methods in calculus of variations, rate of convergence
exact penalty functions, Numerical mathematical programming methods, Nonlinear programming, Other numerical methods in calculus of variations, rate of convergence
| 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). | 0 | |
| 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. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
