Approximations in proximal bundle methods and decomposition of convex programs
From MaRDI portal
Recommendations
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- A proximal bundle method for nonsmooth and nonconvex constrained optimization
- A proximal bundle method based on approximate subgradients
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- A proximal-projection partial bundle method for convex constrained minimax problems
- Proximal bundle methods for nonsmooth DC programming
- Efficiency of proximal bundle methods
- Optimal Convergence Rates for the Proximal Bundle Method
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
Cites work
- scientific article; zbMATH DE number 3830713 (Why is no real title available?)
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3898618 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 195139 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- A Cholesky dual method for proximal piecewise linear programming
- A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A class of convergent primal-dual subgradient algorithms for decomposable convex programs
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- An Algorithm for Nonsmooth Convex Minimization With Errors
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Applications of the method of partial inverses to convex programming: Decomposition
- Convergence of some algorithms for convex minimization
- Decomposition Principle for Linear Programs
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- Lagrangian decomposition and nonsmooth optimization: bundle algorithm, prox iteration, augmented Lagrangian
- Methods of descent for nondifferentiable optimization
- Monotone Operators and the Proximal Point Algorithm
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Proximity control in bundle methods for convex nondifferentiable minimization
Cited in
(43)- scientific article; zbMATH DE number 2201296 (Why is no real title available?)
- Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
- Survey of Bundle Methods for Nonsmooth Optimization
- A decomposition algorithm for convex nondifferentiable minimization with errors
- Linear convergence of the derivative-free proximal bundle method on convex nonsmooth functions, with application to the derivative-free \(\mathcal{VU}\)-algorithm
- On approximations with finite precision in bundle methods for nonsmooth optimization
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
- A proximal bundle method based on approximate subgradients
- An approximate bundle-type auxiliary problem method for solving generalized variational inequalities
- Scalable branching on dual decomposition of stochastic mixed-integer programming problems
- Convergence of the approximate auxiliary problem method for solving generalized variational inequalities
- Bundle-based decomposition: Conditions for convergence
- Proximal decomposition of convex optimization via an alternating linearization algorithm with inexact oracles
- Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems
- A feasibility-ensured Lagrangian heuristic for general decomposable problems
- A two-phase bundle method with bundle modification for nonsmooth constrained 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
- A descent proximal level bundle method for convex nondifferentiable optimization
- Incremental-like bundle methods with application to energy planning
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
- scientific article; zbMATH DE number 3979878 (Why is no real title available?)
- Dynamic bundle methods
- An alternating linearization method with inexact data for bilevel nonsmooth convex optimization
- Epsilon-proximal decomposition method
- An approximate quasi-Newton bundle-type method for nonsmooth optimization
- Implementation of an oracle-structured bundle method for distributed optimization
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
- Proximal-based pre-correction decomposition methods for structured convex minimization problems
- A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data
- A hybrid approach of bundle and Benders applied large mixed linear integer problem
- An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems
- Interior-point methods with decomposition for solving large-scale linear programs
- A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization
- Bundle method for non-convex minimization with inexact subgradients and function values
- On parallelizing dual decomposition in stochastic integer programming
- An inexact bundle variant suited to column generation
- Efficiency of proximal bundle methods
- A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems
This page was built for publication: Approximations in proximal bundle methods and decomposition of convex programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893328)
