A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization
Published 2019 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization
Authors
Keywords
Smooth unconstrained minimization, Bunch–Parlett–Kaufman factorizations, Regularization, Newton-type methods
Journal
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
Volume -, Issue -, Pages -
Publisher
Springer Nature
Online
2019-03-21
DOI
10.1007/s10589-019-00089-7
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy
- (2019) Coralia Cartis et al. SIAM JOURNAL ON OPTIMIZATION
- On Regularization and Active-set Methods with Complexity for Constrained Optimization
- (2018) E. G. Birgin et al. SIAM JOURNAL ON OPTIMIZATION
- ARCq: a new adaptive regularization by cubics
- (2017) Jean-Pierre Dussault OPTIMIZATION METHODS & SOFTWARE
- On High-order Model Regularization for Constrained Optimization
- (2017) José Mario Martínez SIAM JOURNAL ON OPTIMIZATION
- Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians
- (2017) G. N. Grapiglia et al. SIAM JOURNAL ON OPTIMIZATION
- The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization
- (2017) E. G. Birgin et al. SIAM JOURNAL ON OPTIMIZATION
- Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
- (2016) J. M. Martínez et al. JOURNAL OF GLOBAL OPTIMIZATION
- A trust region algorithm with a worst-case iteration complexity of $$\mathcal{O}(\epsilon ^{-3/2})$$ O ( ϵ - 3 / 2 ) for nonconvex optimization
- (2016) Frank E. Curtis et al. MATHEMATICAL PROGRAMMING
- Algebraic rules for quadratic regularization of Newton’s method
- (2014) Elizabeth W. Karas et al. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
- CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization
- (2014) Nicholas I. M. Gould et al. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
- Evaluating bound-constrained minimization software
- (2012) Ernesto G. Birgin et al. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
- Updating the regularization parameter in the adaptive cubic regularization algorithm
- (2011) N. I. M. Gould et al. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
- (2010) Sha Lu et al. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
- Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity
- (2010) Coralia Cartis et al. MATHEMATICAL PROGRAMMING
- On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
- (2010) C. Cartis et al. SIAM JOURNAL ON OPTIMIZATION
- Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results
- (2009) Coralia Cartis et al. MATHEMATICAL PROGRAMMING
Add your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload NowBecome a Peeref-certified reviewer
The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.
Get Started