A proximal bundle method based on approximate subgradients
From MaRDI portal
Recommendations
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- An infeasible bundle method based on approximate subgradients for nonsmooth optimization
- Approximations in proximal bundle methods and decomposition of convex programs
- A modified BFGS bundle algorithm based on approximate subgradients
- On approximations with finite precision in bundle methods for nonsmooth optimization
Cited in
(50)- A study on the dual problem of nonsmooth bundle method based on approximate subgradients
- Essentials of numerical nonsmooth optimization
- 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
- A decomposition algorithm for convex nondifferentiable minimization with errors
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- 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
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- A quasi-Newton bundle method based on approximate subgradients
- Bundle trust region algorithm based on linear subproblem
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- A proximal bundle approach for solving the generalized variational inequalities with inexact data
- An approximate decomposition algorithm for convex minimization
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- Essentials of numerical nonsmooth optimization
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
- Computing proximal points of convex functions with inexact subgradients
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- Global optimization for non-convex programs via convex proximal point method
- Incremental-like bundle methods with application to energy planning
- A proximal bundle method with inexact data for convex nondifferentiable minimization
- An approximate \(\mathcal U\)-Lagrangian and algorithm to \(\mathcal{UV}\) decomposition
- 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
- An approximate bundle method for solving nonsmooth equilibrium problems
- An alternating linearization method with inexact data for bilevel nonsmooth convex optimization
- An inexact spectral bundle method for convex quadratic semidefinite programming
- Approximate Rolle's theorems for the proximal subgradient and the generalized gradient.
- An approximate quasi-Newton bundle-type method for nonsmooth optimization
- 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
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data
- An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems
- Bundle method for non-convex minimization with inexact subgradients and function values
- Structured nonsmooth optimization using functional encoding and branching information
- A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
- An inexact bundle variant suited to column generation
- A modified BFGS bundle algorithm based on approximate subgradients
- A geometric integration approach to nonsmooth, nonconvex optimisation
- Benders decomposition with adaptive oracles for large scale optimization
- A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions
This page was built for publication: A proximal bundle method based on approximate subgradients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948403)
