A Proximal Bundle Method with Approximate Subgradient Linearizations
From MaRDI portal
Recommendations
- A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming
- Approximations in proximal bundle methods and decomposition of convex programs
- A proximal bundle method based on approximate subgradients
- On approximations with finite precision in bundle methods for nonsmooth optimization
- A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization
Cited in
(70)- An asynchronous bundle-trust-region method for dual decomposition of stochastic mixed-integer programming
- Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
- Essentials of numerical nonsmooth optimization
- Nonconvex bundle method with application to a delamination problem
- First-order methods of smooth convex optimization with inexact oracle
- A doubly stabilized bundle method for nonsmooth convex optimization
- Approximations in proximal bundle methods and decomposition of convex programs
- Level bundle methods for constrained convex optimization with various oracles
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Prices stabilization for inexact unit-commitment problems
- Regularized decomposition of large scale block-structured robust optimization problems
- A bundle method using two polyhedral approximations of the -enlargement of a maximal monotone operator
- On approximations with finite precision in bundle methods for nonsmooth optimization
- Outer-approximation algorithms for nonsmooth convex MINLP problems
- Optimal Convergence Rates for the Proximal Bundle Method
- Incremental bundle methods using upper models
- Divide to conquer: decomposition methods for energy optimization
- Minimizing Piecewise-Concave Functions Over Polyhedra
- The omnipresence of Lagrange
- A proximal bundle method based on approximate subgradients
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
- A proximal bundle approach for solving the generalized variational inequalities with inexact data
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Essentials of numerical nonsmooth optimization
- A feasible point method with bundle modification for nonsmooth convex constrained optimization
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
- Proximal bundle methods for nonsmooth DC programming
- 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
- Computing proximal points of convex functions with inexact subgradients
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- Incremental-like bundle methods with application to energy planning
- A proximal analytic center cutting plane algorithm for solving variational inequality problems
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
- The new inexact bundle-type technique to solve variational inequalities of composite structures
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization
- scientific article; zbMATH DE number 3979878 (Why is no real title available?)
- The method of codifferential descent for convex and global piecewise affine optimization
- An approximate bundle method for solving nonsmooth equilibrium problems
- Dynamic bundle methods
- An inexact spectral bundle method for convex quadratic semidefinite programming
- Approximate Rolle's theorems for the proximal subgradient and the generalized gradient.
- Adaptive Bundle Methods for Nonlinear Robust Optimization
- Comparison of bundle and classical column generation
- Dual norm based iterative methods for image restoration
- Active set-based inexact proximal bundle algorithm for stochastic quadratic programming
- Uncontrolled inexact information within bundle methods
- Probabilistic optimization via approximate \(p\)-efficient points and bundle methods
- Revisiting augmented Lagrangian duals
- Implementation of an oracle-structured bundle method for distributed optimization
- Level bundle methods for oracles with on-demand accuracy
- A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming
- The effect of deterministic noise in subgradient methods
- Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz -optimal approach using Lagrangian relaxation
- An incremental bundle method for portfolio selection problem under second-order stochastic dominance
- A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization
- Bundle method for non-convex minimization with inexact subgradients and function values
- Structured nonsmooth optimization using functional encoding and branching information
- Derivative-free optimization via proximal point methods
- An inexact bundle variant suited to column generation
- A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems
- Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates
- A modified BFGS bundle algorithm based on approximate subgradients
- Benders decomposition with adaptive oracles for large scale optimization
- Epsilon-subgradient optimization techniques in convex programming and Lagrangian duality
- On solving the convex semi-infinite minimax problems via superlinear \(\mathcal{VU}\) incremental bundle technique with partial inexact oracle
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
This page was built for publication: A Proximal Bundle Method with Approximate Subgradient Linearizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470229)
