An inexact proximal regularization method for unconstrained optimization
From MaRDI portal
Publication:522090
DOI10.1007/S00186-016-0561-1zbMATH Open1364.90311OpenAlexW2521415408MaRDI QIDQ522090FDOQ522090
Authors: Paul Armand, Isaï Lankoandé 
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
Recommendations
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- Inertial proximal point regularization algorithm for unconstrained vector convex optimization problems
- scientific article; zbMATH DE number 1042861
- Regularized proximal method for minimization problems with inaccurate initial data
- A new proximal algorithm for unconstrained nonconvex optimization problems
- New inertial proximal gradient methods for unconstrained convex optimization problems
- An inexact proximal method for quasiconvex minimization
- A regularization method for the proximal point algorithm
- An inexact proximal generalized alternating direction method of multipliers
- A generalized univariate Newton method motivated by proximal regularization
Cites Work
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- A Nonmonotone Line Search Technique for Newton’s Method
- Title not available (Why is that?)
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- Inexact proximal point algorithms and descent methods in optimization
- Regularized Newton methods for convex minimization problems with singular solutions
- A regularized Newton method for degenerate unconstrained optimization problems
- Regularized Newton method for unconstrained convex optimization
- Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
- Self-adaptive inexact proximal point methods
- Interior-point methods for nonconvex nonlinear programming: cubic regularization
- A regularized Newton method for monotone nonlinear equations and its application
- From global to local convergence of interior methods for nonlinear optimization
- Study of a primal-dual algorithm for equality constrained minimization
- Descentwise inexact proximal algorithms for smooth optimization
- A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization
- A regularized Newton method without line search for unconstrained optimization
- Truncated regularized Newton method for convex minimizations
Cited In (15)
- An inexact Riemannian proximal gradient method
- Properties of the proximate parameter tuning regularization algorithm
- An efficient gradient method with approximately optimal stepsizes based on regularization models for unconstrained optimization
- Descentwise inexact proximal algorithms for smooth optimization
- Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound
- A regularized Newton method for degenerate unconstrained optimization problems
- A regularized factorization-free method for equality-constrained optimization
- Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC
- Inertial proximal point regularization algorithm for unconstrained vector convex optimization problems
- A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- On large-scale unconstrained optimization and arbitrary regularization
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- Inexact version of Bregman proximal gradient algorithm
- A proximal regularization of the steepest descent method
- Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization
Uses Software
This page was built for publication: An inexact proximal regularization method for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522090)
