A regularized Newton method without line search for unconstrained optimization
From MaRDI portal
Publication:742310
DOI10.1007/s10589-014-9656-xzbMath1302.90218MaRDI QIDQ742310
Publication date: 18 September 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-014-9656-x
Related Items
A Perry-type derivative-free algorithm for solving nonlinear system of equations and minimizing ℓ1regularized problem, Correction of trust region method with a new modified Newton method, A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima, A fast and simple modification of Newton's method avoiding saddle points, Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization, Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence, An inexact proximal regularization method for unconstrained optimization, On a global complexity bound of the Levenberg-marquardt method, A regularized Newton method without line search for unconstrained optimization, Descent line search scheme using Geršgorin circle theorem, A new augmented Lagrangian method for equality constrained optimization with simple unconstrained subproblem, A new regularized quasi-Newton method for unconstrained optimization, Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC, A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations, Erratum to: ``A regularized Newton method without line search for unconstrained optimization
Uses Software
Cites Work
- Unnamed Item
- Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
- A regularized Newton method without line search for unconstrained optimization
- Truncated regularized Newton method for convex minimizations
- Regularized Newton method for unconstrained convex optimization
- Error bounds in mathematical programming
- Introductory lectures on convex optimization. A basic course.
- Regularized Newton methods for convex minimization problems with singular solutions
- A regularized Newton method for degenerate unconstrained optimization problems
- Cubic regularization of Newton method and its global performance
- On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- On second order conditions for quasiconvexity
- A Modified Cholesky Algorithm Based on a Symmetric Indefinite Factorization
- Accurate Symmetric Indefinite Linear Equation Solvers
- Trust Region Methods
- CUTEr and SifDec
- Benchmarking optimization software with performance profiles.
