An inexact proximal regularization method for unconstrained optimization
type: Item
instance of: scholarly article
title: An inexact proximal regularization method for unconstrained optimization
zbMATH Open document ID: 1364.90311
author: Paul Armand
author: Isaï Lankoandé
published in: Mathematical Methods of Operations Research
publication date: 2017-04-13T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C53
zbMATH DE Number: 6705659
zbMATH Keywords: regularized Newton method
zbMATH Keywords: unconstrained optimization
describes a project that uses: CUTEst
MaRDI profile type: Publication
full work available at URL: s00186-016-0561-1
OpenAlex ID: W2521415408
cites work: Study of a primal-dual algorithm for equality constrained minimization
cites work: From global to local convergence of interior methods for nonlinear optimization
cites work: A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization
cites work: Interior-point methods for nonconvex nonlinear programming: cubic regularization
cites work: A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
cites work: Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
cites work: Benchmarking optimization software with performance profiles.
cites work: A regularized Newton method for monotone nonlinear equations and its application
cites work: Descentwise inexact proximal algorithms for smooth optimization
cites work: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
cites work: A Nonmonotone Line Search Technique for Newton’s Method
cites work: Self-adaptive inexact proximal point methods
cites work: Q3998992
cites work: Inexact proximal point algorithms and descent methods in optimization
cites work: Regularized Newton methods for convex minimization problems with singular solutions
cites work: Truncated regularized Newton method for convex minimizations
cites work: Regularized Newton method for unconstrained convex optimization
cites work: An inexact and nonmonotone proximal method for smooth unconstrained minimization
cites work: A regularized Newton method for degenerate unconstrained optimization problems
cites work: Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
cites work: A regularized Newton method without line search for unconstrained optimization
cites work: Q2765625
DOI: 10.1007/S00186-016-0561-1
Recommended article: An inexact and nonmonotone proximal method for smooth unconstrained minimization
Recommended article: Inertial proximal point regularization algorithm for unconstrained vector convex optimization problems
Recommended article: Q4346410
Recommended article: Regularized proximal method for minimization problems with inaccurate initial data
Recommended article: Q4687818
Recommended article: New inertial proximal gradient methods for unconstrained convex optimization problems
Recommended article: An inexact proximal method for quasiconvex minimization
Recommended article: A regularization method for the proximal point algorithm
Recommended article: An inexact proximal generalized alternating direction method of multipliers
Recommended article: A generalized univariate Newton method motivated by proximal regularization
description: scientific article; zbMATH DE number 6705659