A Proximal Bundle Method with Approximate Subgradient Linearizations
From MaRDI portal
Publication:5470229
DOI10.1137/040603929zbMath1104.65055OpenAlexW2089472568MaRDI QIDQ5470229
Publication date: 30 May 2006
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/040603929
algorithmconvex programmingnondifferentiable optimizationproximal bundle methodsapproximate subgradients
Related Items
A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator, Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems, Nonconvex bundle method with application to a delamination problem, Prices stabilization for inexact unit-commitment problems, Probabilistic optimization via approximate \(p\)-efficient points and bundle methods, Dynamic bundle methods, Level bundle methods for oracles with on-demand accuracy, Uncontrolled inexact information within bundle methods, An approximate bundle method for solving nonsmooth equilibrium problems, Dual norm based iterative methods for image restoration, Fast bundle-level methods for unconstrained and ball-constrained convex optimization, A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information, First-order methods of smooth convex optimization with inexact oracle, Level bundle methods for constrained convex optimization with various oracles, Adaptive Bundle Methods for Nonlinear Robust Optimization, Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation, Optimal Convergence Rates for the Proximal Bundle Method, A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems, A derivative-free 𝒱𝒰-algorithm for convex finite-max problems, Incremental Bundle Methods using Upper Models, 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, A proximal analytic center cutting plane algorithm for solving variational inequality problems, An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems, The effect of deterministic noise in subgradient methods, An Asynchronous Bundle-Trust-Region Method for Dual Decomposition of Stochastic Mixed-Integer Programming, Convex proximal bundle methods in depth: a unified analysis for inexact oracles, Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs, A feasible point method with bundle modification for nonsmooth convex constrained optimization, Derivative-free optimization via proximal point methods, Comparison of bundle and classical column generation, An inexact spectral bundle method for convex quadratic semidefinite programming, Outer-approximation algorithms for nonsmooth convex MINLP problems, Incremental-like bundle methods with application to energy planning, Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values, Divide to conquer: decomposition methods for energy optimization, Proximal bundle methods for nonsmooth DC programming, The omnipresence of Lagrange, An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space, Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization, An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information, Regularized decomposition of large scale block-structured robust optimization problems, A proximal bundle method for nonsmooth nonconvex functions with inexact information, Essentials of numerical nonsmooth optimization, An inexact bundle variant suited to column generation, Minimizing Piecewise-Concave Functions Over Polyhedra, Benders decomposition with adaptive oracles for large scale optimization, Revisiting augmented Lagrangian duals, The method of codifferential descent for convex and global piecewise affine optimization, Essentials of numerical nonsmooth optimization, On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle, A doubly stabilized bundle method for nonsmooth convex optimization
