An inexact and nonmonotone proximal method for smooth unconstrained minimization

DOI10.1016/j.cam.2014.03.023zbMath1293.49072OpenAlexW2051111534MaRDI QIDQ2252253

R. C. M. Silva, Sandra Augusta Santos

Publication date: 16 July 2014

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2014.03.023

zbMATH Keywords

global convergencenumerical experimentsunconstrained minimizationnonconvex problemsnonmonotone line searchproximal point algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

On the Barzilai–Borwein gradient methods with structured secant equation for nonlinear least squares problems ⋮ An inexact proximal method for quasiconvex minimization ⋮ Gradient descent technology for sparse vector learning in ontology algorithms ⋮ A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors ⋮ Structured two-point stepsize gradient methods for nonlinear least squares ⋮ A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares ⋮ An inexact proximal regularization method for unconstrained optimization ⋮ Perturbation resilience of proximal gradient algorithm for composite objectives ⋮ Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC

Uses Software

• CUTEr
• SifDec
• HSL-VF05

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• An efficient nonmonotone trust-region method for unconstrained optimization
• A nonmonotone trust region method with adaptive radius for unconstrained optimization problems
• A filter trust-region algorithm for unconstrained optimization with strong global convergence properties
• Nonmonotonic trust region algorithm
• Descentwise inexact proximal algorithms for smooth optimization
• A new trust region method for unconstrained optimization
• Self-adaptive inexact proximal point methods
• Convergence of nonmonotone line search method
• Inexact proximal point algorithms and descent methods in optimization
• Truncated-Newton algorithms for large-scale unconstrained optimization
• The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Trust Region Methods
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• Solving the Trust-Region Subproblem using the Lanczos Method
• CUTEr and SifDec
• A Filter-Trust-Region Method for Unconstrained Optimization
• Benchmarking optimization software with performance profiles.