New limited memory bundle method for large-scale nonsmooth optimization
From MaRDI portal
Publication:5460656
DOI10.1080/10556780410001689225zbMath1068.90101OpenAlexW1963488456WikidataQ109315022 ScholiaQ109315022MaRDI QIDQ5460656
M. Haarala, Marko M. Mäkelä, Kaisa M. Miettinen
Publication date: 18 July 2005
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780410001689225
large-scale optimizationvariable metric methodstest problemsbundle methodsnondifferentiable programminglimited memory methods
Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (56)
Comparing different nonsmooth minimization methods and software ⋮ A gradient sampling method based on ideal direction for solving nonsmooth optimization problems ⋮ A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems ⋮ A new trust region method for nonsmooth nonconvex optimization ⋮ A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions ⋮ Limited-memory BFGS with displacement aggregation ⋮ An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems ⋮ A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization ⋮ Subgradient method for nonconvex nonsmooth optimization ⋮ Globally convergent limited memory bundle method for large-scale nonsmooth optimization ⋮ Composite proximal bundle method ⋮ Primal–dual accelerated gradient methods with small-dimensional relaxation oracle ⋮ A conjugate gradient sampling method for nonsmooth optimization ⋮ Nonsmooth optimization via quasi-Newton methods ⋮ A simple version of bundle method with linear programming ⋮ A hierarchy of spectral relaxations for polynomial optimization ⋮ An efficient conjugate gradient method with strong convergence properties for non-smooth optimization ⋮ Clusterwise support vector linear regression ⋮ Limited memory interior point bundle method for large inequality constrained nonsmooth minimization ⋮ New diagonal bundle method for clustering problems in large data sets ⋮ A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees ⋮ A new nonmonotone line search method for nonsmooth nonconvex optimization ⋮ Solving dual problems using a coevolutionary optimization algorithm ⋮ A modified conjugate gradient method for general convex functions ⋮ A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization ⋮ Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization ⋮ Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality ⋮ A new smoothing conjugate gradient method for solving nonlinear nonsmooth complementarity problems ⋮ Diagonal bundle method for nonsmooth sparse optimization ⋮ A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization ⋮ A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization ⋮ Aggregate subgradient method for nonsmooth DC optimization ⋮ A quasisecant method for solving a system of nonsmooth equations ⋮ An adaptive competitive penalty method for nonsmooth constrained optimization ⋮ A fast gradient and function sampling method for finite-max functions ⋮ A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs ⋮ Codifferential method for minimizing nonsmooth DC functions ⋮ Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization ⋮ A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions ⋮ Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization ⋮ Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems ⋮ A method for convex black-box integer global optimization ⋮ Diagonal discrete gradient bundle method for derivative free nonsmooth optimization ⋮ Influence of a neighborhood shape on the efficiency of continuous variable neighborhood search ⋮ LDGB ⋮ A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration ⋮ An algorithm for nonsmooth optimization by successive piecewise linearization ⋮ A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems ⋮ Subgradient and Bundle Methods for Nonsmooth Optimization ⋮ Efficient hybrid methods for global continuous optimization based on simulated annealing ⋮ Weak subgradient method for solving nonsmooth nonconvex optimization problems ⋮ Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems ⋮ An adaptive gradient sampling algorithm for non-smooth optimization ⋮ A memory gradient method for non-smooth convex optimization ⋮ Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization ⋮ A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
Uses Software
Cites Work
- Unnamed Item
- On the limited memory BFGS method for large scale optimization
- Partitioned variable metric updates for large structured optimization problems
- Representations of quasi-Newton matrices and their use in limited memory methods
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Comparison of formulations and solution methods for image restoration problems
- An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization
- An Efficient Method to Solve the Minimax Problem Directly
- BFGS with Update Skipping and Varying Memory
- Survey of Bundle Methods for Nonsmooth Optimization
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Benchmarking optimization software with performance profiles.
This page was built for publication: New limited memory bundle method for large-scale nonsmooth optimization
