An inexact proximal regularization method for unconstrained optimization
From MaRDI portal
Publication:522090
DOI10.1007/s00186-016-0561-1zbMath1364.90311OpenAlexW2521415408MaRDI QIDQ522090
Publication date: 13 April 2017
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-016-0561-1
Related Items
A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization, Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Interior-point methods for nonconvex nonlinear programming: cubic regularization
- Study of a primal-dual algorithm for equality constrained minimization
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- 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
- Regularized Newton methods for convex minimization problems with singular solutions
- A regularized Newton method for degenerate unconstrained optimization problems
- Descentwise inexact proximal algorithms for smooth optimization
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Self-adaptive inexact proximal point methods
- Inexact proximal point algorithms and descent methods in optimization
- From global to local convergence of interior methods for nonlinear optimization
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization
- A regularized Newton method for monotone nonlinear equations and its application
- Benchmarking optimization software with performance profiles.
