An ODE-like nonmonotone method for nonsmooth convex optimization
From MaRDI portal
Recommendations
- A memory gradient method for non-smooth convex optimization
- Conjugate gradient type methods for the nondifferentiable convex minimization
- A trust region method for nonsmooth convex optimization
- An approximate quasi-Newton bundle-type method for nonsmooth optimization
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
Cites work
- A bundle-Newton method for nonsmooth unconstrained minimization
- A continuous Newton-type method for unconstrained optimization
- A descent algorithm for nonsmooth convex optimization
- A family of variable metric proximal methods
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- A hybrid trust region algorithm for unconstrained optimization
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- A new trust region algorithm for nonsmooth convex minimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A nonmonotone trust-region line search method for large-scale unconstrained optimization
- A quasi-second-order proximal bundle algorithm
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
- A trust region method for nonsmooth convex optimization
- An approximate quasi-Newton bundle-type method for nonsmooth optimization
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- An ODE-based nonmonotone method for unconstrained optimization problems
- Benchmarking optimization software with performance profiles.
- Combining trust-region techniques and Rosenbrock methods to compute stationary points
- Conjugate gradient type methods for the nondifferentiable convex minimization
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Globally convergent BFGS method for nonsmooth convex optimization
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 930661 (Why is no real title available?)
- Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
- Neurodynamical optimization
- Nonmonotone bundle-type scheme for convex nonsmooth minimization
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- Nonmonotone trust region method for solving optimization problems
- Nonmonotonic trust region algorithm
- Numerical methods for nondifferentiable convex optimization
- On the nonmonotone line search
- On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
- Optimization and nonsmooth analysis
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- The Barzilai and Borwein gradient method with nonmonotone line search for nonsmooth convex optimization problems
- Trust Region Algorithms and Timestep Selection
Cited in
(7)- A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization
- An ODE-based approach to nonlinearly constrained minimax problems
- Conjugate gradient type methods for the nondifferentiable convex minimization
- Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
- Yosida-regularization based differential equation approach to generalized equations with applications to nonlinear convex programming
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- A memory gradient method for non-smooth convex optimization
This page was built for publication: An ODE-like nonmonotone method for nonsmooth convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q330379)
