Globally convergent limited memory bundle method for large-scale nonsmooth optimization

DOI10.1007/s10107-006-0728-2zbMath1278.90451OpenAlexW2074522218WikidataQ109314954 ScholiaQ109314954MaRDI QIDQ868454

Napsu Haarala, Kaisa M. Miettinen, Marko M. Mäkelä

Publication date: 5 March 2007

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-006-0728-2

zbMATH Keywords

global convergencelarge-scale optimizationvariable metric methodsbundle methodsnondifferentiable programminglimited memory methods

Mathematics Subject Classification ID

Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Numerical optimization and variational techniques (65K10)

Related Items (46)

Comparing different nonsmooth minimization methods and software ⋮ A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator ⋮ Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization ⋮ An ODE-like nonmonotone method for nonsmooth convex optimization ⋮ Subgradient method for nonconvex nonsmooth optimization ⋮ An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions ⋮ An extension of the quasi-Newton method for minimizing locally Lipschitz functions ⋮ A gradient sampling algorithm for stratified maps with applications to topological data analysis ⋮ A hierarchy of spectral relaxations for polynomial optimization ⋮ Clusterwise support vector linear regression ⋮ Generalized order-value optimization ⋮ Numerical infinitesimals in a variable metric method for convex nonsmooth optimization ⋮ Limited memory interior point bundle method for large inequality constrained nonsmooth minimization ⋮ New diagonal bundle method for clustering problems in large data sets ⋮ Conjugate gradient type methods for the nondifferentiable convex minimization ⋮ A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems ⋮ A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization ⋮ An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems ⋮ 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 ⋮ Constrained nonconvex nonsmooth optimization via proximal bundle method ⋮ Diagonal bundle method for nonsmooth sparse 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 ⋮ A convergence analysis of the method of codifferential descent ⋮ Minimization of marginal functions in mathematical programming based on continuous outer subdifferentials ⋮ Concurrent processing of mixed‐integer non‐linear programming problems ⋮ Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization ⋮ An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space ⋮ Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems ⋮ Essentials of numerical nonsmooth optimization ⋮ Diagonal discrete gradient bundle method for derivative free nonsmooth optimization ⋮ Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions ⋮ A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration ⋮ Subgradient and Bundle Methods for Nonsmooth Optimization ⋮ Solving generalized inverse eigenvalue problems via L-BFGS-B method ⋮ A splitting bundle approach for non-smooth non-convex minimization ⋮ Weak subgradient method for solving nonsmooth nonconvex optimization problems ⋮ A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems ⋮ Essentials of numerical nonsmooth optimization ⋮ Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems ⋮ Aggregate codifferential method for nonsmooth DC optimization ⋮ A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles ⋮ 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

• L-BFGS
• LDGB
• NSOLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization of upper semidifferentiable functions
• Some numerical experiments with variable-storage quasi-Newton algorithms
• On the limited memory BFGS method for large scale optimization
• Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
• Nonconvex optimization in mechanics. Algorithms, heuristics and engineering applications by the F. E. M
• Comparing nonsmooth nonconvex bundle methods in solving hemivariational inequalities
• Representations of quasi-Newton matrices and their use in limited memory methods
• Globally convergent variable metric method for convex nonsmooth unconstrained minimization
• Methods of descent for nondifferentiable optimization
• Comparison of formulations and solution methods for image restoration problems
• Optimization and nonsmooth analysis
• A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
• Updating Quasi-Newton Matrices with Limited Storage
• A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• Survey of Bundle Methods for Nonsmooth Optimization
• New limited memory bundle method for large-scale nonsmooth optimization
• Bundle methods in stochastic optimal power management: A disaggregated approach using preconditioners
• Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
• Benchmarking optimization software with performance profiles.

This page was built for publication: Globally convergent limited memory bundle method for large-scale nonsmooth optimization