Implementation of an oracle-structured bundle method for distributed optimization
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3724209 (Why is no real title available?)
- scientific article; zbMATH DE number 3559294 (Why is no real title available?)
- scientific article; zbMATH DE number 3619637 (Why is no real title available?)
- scientific article; zbMATH DE number 686906 (Why is no real title available?)
- scientific article; zbMATH DE number 1070385 (Why is no real title available?)
- scientific article; zbMATH DE number 2084780 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- A Spectral Bundle Method for Semidefinite Programming
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A bundle Bregman proximal method for convex nondifferentiable minimization
- A bundle-Newton method for nonsmooth unconstrained minimization
- A bundle-type algorithm for routing in telecommunication data networks
- A central cutting plane algorithm for the convex programming problem
- A cutting plane algorithm for convex programming that uses analytic centers
- A doubly stabilized bundle method for nonsmooth convex optimization
- A proximal bundle method based on approximate subgradients
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A quasi-second-order proximal bundle algorithm
- A survey of algorithms for convex multicommodity flow problems
- Adaptive subgradient methods for online learning and stochastic optimization
- Advances and Open Problems in Federated Learning
- An Algorithm for Nonsmooth Convex Minimization With Errors
- An additive subfamily of enlargements of a maximally monotone operator
- An aggregate subgradient method for nonsmooth convex minimization
- An asynchronous bundle-trust-region method for dual decomposition of stochastic mixed-integer programming
- An iterative solution of a variational inequality for certain monotone operators in Hilbert space
- Ant colony optimization for the nonlinear resource allocation problem
- Approximations in proximal bundle methods and decomposition of convex programs
- Asynchronous level bundle methods
- Block Preconditioning for the Conjugate Gradient Method
- Bundle methods for regularized risk minimization
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Bundle methods in stochastic optimal power management: A disaggregated approach using preconditioners
- CVXPY: a Python-embedded modeling language for convex optimization
- Convergence Rates in Forward--Backward Splitting
- Convergence of some algorithms for convex minimization
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
- Disciplined convex programming
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Efficiency of proximal bundle methods
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Generalized Bundle Methods
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Incremental bundle methods using upper models
- Incremental-like bundle methods with application to energy planning
- Inexact spectral projected gradient methods on convex sets
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
- Methods of conjugate gradients for solving linear systems
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- New limited memory bundle method for large-scale nonsmooth optimization
- New variants of bundle methods
- Newton's method for convex programming and Tschebyscheff approximation
- Nondifferentiable optimization. Transl. from the Russian by Tetsushi Sasagawa
- Numerical Optimization
- On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
- On the choice of explicit stabilizing terms in column generation
- On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
- Optimal Convergence Rates for the Proximal Bundle Method
- Probabilistic optimization via approximate \(p\)-efficient points and bundle methods
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- Proximal splitting methods in signal processing
- Proximity control in bundle methods for convex nondifferentiable minimization
- Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
- Semismooth and Semiconvex Functions in Constrained Optimization
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- The Cutting-Plane Method for Solving Convex Programs
- Variable metric bundle methods: From conceptual to implementable forms
Cited in
(2)
This page was built for publication: Implementation of an oracle-structured bundle method for distributed optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6640181)
