A proximal bundle method for nonsmooth nonconvex functions with inexact information

DOI10.1007/s10589-015-9762-4zbMath1343.90069OpenAlexW356322785MaRDI QIDQ5963307

Mikhail V. Solodov, W. Hare, Claudia A. Sagastizábal

Publication date: 7 March 2016

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-015-9762-4

zbMATH Keywords

nonsmooth optimizationnonconvex optimizationbundle methodinexact informationlocally Lipschitz functionsproximal point

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Numerical methods based on necessary conditions (49M05) Nonsmooth analysis (49J52)

Related Items (53)

A Trust-region Method for Nonsmooth Nonconvex Optimization ⋮ A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods ⋮ A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions ⋮ An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems ⋮ A discussion of probability functions and constraints from a variational perspective ⋮ A discussion on variational analysis in derivative-free optimization ⋮ A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming ⋮ Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems ⋮ An Inexact Bundle Method and Subgradient Computations for Optimal Control of Deterministic and Stochastic Obstacle Problems ⋮ Optimization conditions and decomposable algorithms for convertible nonconvex optimization ⋮ A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions ⋮ Nonconvex bundle method with application to a delamination problem ⋮ An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems ⋮ An approximate bundle method for solving nonsmooth equilibrium problems ⋮ A multi-step doubly stabilized bundle method for nonsmooth convex optimization ⋮ Computing proximal points of convex functions with inexact subgradients ⋮ A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems ⋮ A simple version of bundle method with linear programming ⋮ A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ Alternating forward-backward splitting for linearly constrained optimization problems ⋮ Adaptive Bundle Methods for Nonlinear Robust Optimization ⋮ A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective ⋮ New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information ⋮ Optimal Convergence Rates for the Proximal Bundle Method ⋮ A derivative-free 𝒱𝒰-algorithm for convex finite-max problems ⋮ An incremental bundle method for portfolio selection problem under second-order stochastic dominance ⋮ A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems ⋮ A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information ⋮ Spectral projected subgradient method for nonsmooth convex optimization problems ⋮ An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems ⋮ Unnamed Item ⋮ A sharp augmented Lagrangian-based method in constrained non-convex optimization ⋮ A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming ⋮ Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions ⋮ A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization ⋮ The chain rule for VU-decompositions of nonsmooth functions ⋮ An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity ⋮ A filter proximal bundle method for nonsmooth nonconvex constrained optimization ⋮ Proximal bundle methods for nonsmooth DC programming ⋮ A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions ⋮ An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space ⋮ A bundle method for nonsmooth DC programming with application to chance-constrained problems ⋮ An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information ⋮ A Redistributed Bundle Algorithm for Generalized Variational Inequality Problems in Hilbert Spaces ⋮ Regularized decomposition of large scale block-structured robust optimization problems ⋮ A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data ⋮ Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions ⋮ A new restricted memory level bundle method for constrained convex nonsmooth optimization ⋮ Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems ⋮ A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization ⋮ A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization ⋮ On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle

Uses Software

• PNEW
• DGM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A derivative-free approximate gradient sampling algorithm for finite minimax problems
• Convex proximal bundle methods in depth: a unified analysis for inexact oracles
• On approximations with finite precision in bundle methods for nonsmooth optimization
• Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
• Divide to conquer: decomposition methods for energy optimization
• Discrete gradient method: Derivative-free method for nonsmooth optimization
• Incremental-like bundle methods with application to energy planning
• Error stability properties of generalized gradient-type algorithms
• A bundle-Newton method for nonsmooth unconstrained minimization
• Approximate convexity and submonotonicity.
• Approximations in proximal bundle methods and decomposition of convex programs
• The effect of deterministic noise in subgradient methods
• Methods of descent for nondifferentiable optimization
• A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
• A Redistributed Proximal Bundle Method for Nonconvex Optimization
• Piecewise-quadratic Approximations in Convex Numerical Optimization
• Identifying Structure of Nonsmooth Convex Functions by the Bundle Technique
• Introduction to Derivative-Free Optimization
• On semidefinite bounds for maximization of a non-convex quadratic objective over thel₁unit ball
• A Linearization Algorithm for Nonsmooth Minimization
• Submonotone Subdifferentials of Lipschitz Functions
• A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
• Semismooth and Semiconvex Functions in Constrained Optimization
• Variational Analysis
• Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
• Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
• Derivative-free optimization methods for finite minimax problems
• Computation of the distance to semi-algebraic sets
• Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
• An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
• A Proximal Bundle Method with Approximate Subgradient Linearizations
• Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
• A Convex Quadratic Characterization of the Lovász Theta Number
• Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values
• A proximal bundle method based on approximate subgradients

This page was built for publication: A proximal bundle method for nonsmooth nonconvex functions with inexact information