Pages that link to "Item:Q1893328"
From MaRDI portal
The following pages link to Approximations in proximal bundle methods and decomposition of convex programs (Q1893328):
Displaying 37 items.
- A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
- An approximate quasi-Newton bundle-type method for nonsmooth optimization (Q370139) (← links)
- A decomposition algorithm for convex nondifferentiable minimization with errors (Q410890) (← links)
- Proximal-based pre-correction decomposition methods for structured convex minimization problems (Q489115) (← links)
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems (Q526828) (← links)
- On approximations with finite precision in bundle methods for nonsmooth optimization (Q597165) (← links)
- Convergence of the approximate auxiliary problem method for solving generalized variational inequalities (Q704756) (← links)
- Incremental-like bundle methods with application to energy planning (Q975362) (← links)
- An approximate bundle-type auxiliary problem method for solving generalized variational inequalities (Q1007656) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- Bundle-based decomposition: Conditions for convergence (Q1122487) (← links)
- Interior-point methods with decomposition for solving large-scale linear programs (Q1306665) (← links)
- Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs (Q1338136) (← links)
- Epsilon-proximal decomposition method (Q1424289) (← links)
- Efficiency of proximal bundle methods (Q1573991) (← links)
- A descent proximal level bundle method for convex nondifferentiable optimization (Q1905073) (← links)
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data (Q2066220) (← links)
- A feasibility-ensured Lagrangian heuristic for general decomposable problems (Q2068837) (← links)
- Scalable branching on dual decomposition of stochastic mixed-integer programming problems (Q2125568) (← links)
- An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems (Q2150773) (← links)
- Dynamic bundle methods (Q2390994) (← links)
- Computing proximal points of convex functions with inexact subgradients (Q2413568) (← links)
- A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems (Q2414914) (← links)
- An alternating linearization method with inexact data for bilevel nonsmooth convex optimization (Q2438407) (← links)
- On parallelizing dual decomposition in stochastic integer programming (Q2450615) (← links)
- Survey of Bundle Methods for Nonsmooth Optimization (Q4806340) (← links)
- (Q5037959) (← links)
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space (Q5193505) (← links)
- (Q5313728) (← links)
- Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values (Q5746456) (← links)
- A proximal bundle method for nonsmooth nonconvex functions with inexact information (Q5963307) (← links)
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information (Q6059582) (← links)
- Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems (Q6066721) (← links)
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information (Q6093975) (← links)
- Linear convergence of the derivative-free proximal bundle method on convex nonsmooth functions, with application to the derivative-free \(\mathcal{VU}\)-algorithm (Q6564758) (← links)
- Proximal decomposition of convex optimization via an alternating linearization algorithm with inexact oracles (Q6593193) (← links)
- Implementation of an oracle-structured bundle method for distributed optimization (Q6640181) (← links)
