Name
Abstract | ||
|---|---|---|
In this paper, we analyze some theoretical properties of the problem of minimizing a quadratic function with a cubic regularization term, arising in many methods for unconstrained and constrained optimization that have been proposed in the last years. First we show that, given any stationary point that is not a global solution, it is possible to compute, in closed form, a new point with a smaller objective function value. Then, we prove that a global minimizer can be obtained by computing a finite number of stationary points. Finally, we extend these results to the case where stationary conditions are approximately satisfied, discussing some possible algorithmic applications. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s11590-018-1316-0 | Optimization Letters |
Keywords | Field | DocType |
Unconstrained optimization, Cubic regularization, Global minima | Finite set,Mathematical analysis,Regularization (mathematics),Quadratic function,Stationary point,Mathematics,Stationary conditions,Constrained optimization | Journal |
Volume | Issue | ISSN |
13.0 | 6.0 | 1862-4480 |
Citations | PageRank | References |
0 | 0.34 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrea Cristofari | 1 | 0 | 0.34 |
| Tayebeh Dehghan Niri | 2 | 0 | 0.34 |
| Stefano Lucidi | 3 | 785 | 78.11 |