
doi: 10.1137/0804027
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 results with large-scale problems illustrate the efficiency of this approach.
Large-scale problems in mathematical programming, Convex programming, quadratic smoothing approximation, Other numerical methods in calculus of variations, convex constrained optimization, Deterministic network models in operations research, embedded network structures, nondifferentiable exact penalty functions, nonlinear minimax
Large-scale problems in mathematical programming, Convex programming, quadratic smoothing approximation, Other numerical methods in calculus of variations, convex constrained optimization, Deterministic network models in operations research, embedded network structures, nondifferentiable exact penalty functions, nonlinear minimax
| 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). | 116 | |
| 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 1% | |
| 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 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
