An ODE-like nonmonotone method for nonsmooth convex optimization
From MaRDI portal
Publication:330379
DOI10.1007/s12190-015-0940-4zbMath1349.90684OpenAlexW1410477547MaRDI QIDQ330379
Publication date: 25 October 2016
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-015-0940-4
convergence analysisnonmonotone line searchMoreau-Yosida regularizationnonsmooth convex optimizationODE-based methods
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximate quasi-Newton bundle-type method for nonsmooth optimization
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
- A hybrid trust region algorithm for unconstrained optimization
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- A new trust region algorithm for nonsmooth convex minimization
- Combining trust-region techniques and Rosenbrock methods to compute stationary points
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- A bundle-Newton method for nonsmooth unconstrained minimization
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- Nonmonotone bundle-type scheme for convex nonsmooth minimization
- Nonmonotonic trust region algorithm
- Globally convergent BFGS method for nonsmooth convex optimization
- On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
- Neurodynamical optimization
- A trust region method for nonsmooth convex optimization
- A family of variable metric proximal methods
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- Nonmonotone trust region method for solving optimization problems
- A quasi-second-order proximal bundle algorithm
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- Conjugate gradient type methods for the nondifferentiable convex minimization
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- A nonmonotone trust-region line search method for large-scale unconstrained optimization
- Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
- An ODE-based nonmonotone method for unconstrained optimization problems
- THE BARZILAI AND BORWEIN GRADIENT METHOD WITH NONMONOTONE LINE SEARCH FOR NONSMOOTH CONVEX OPTIMIZATION PROBLEMS
- A descent algorithm for nonsmooth convex optimization
- Optimization and nonsmooth analysis
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Trust Region Algorithms and Timestep Selection
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Numerical methods for nondifferentiable convex optimization
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- Benchmarking optimization software with performance profiles.
- On the nonmonotone line search
This page was built for publication: An ODE-like nonmonotone method for nonsmooth convex optimization