A regularized decomposition method for minimizing a sum of polyhedral functions
Motivated by the two-stage stochastic programming problem with recourse for the case of a discrete distribution of the involved random elements, the author proposes an algorithm for the solution of nonlinear programming problems where the objective function to be minimized is the sum of many convex piecewise-linear functions, the constraints are linear and convex piecewise-linear functions, too. The method generates two sequences: main iterates \(\{x^ k\}\) and trial points \(\{y^ k\}\). At each iteration each of the functions are approximated from below by a pointwise maximum of a finite collection of linear functions and an approximate problem is constructed to find the next trial point. The objective of the approximate problem contains a quadratic term to stabilize it and to keep the number of the elements in the finite collection limited. The approximate problem is solved in each iteration by a special algorithm based on an active set strategy. Convergence analysis is provided together with computational experiences.
- Decomposition method of descent for minimizing the sum of convex nonsmooth functions
- A Descent Algorithm for Minimizing Polyhedral Convex Functions
- An approximate decomposition algorithm for convex minimization
- Decomposition approach for the global minimization of biconcave functions over polytopes
- A Decomposition Method and Its Application to Convex Programming
- A decomposition method for convex minimization problems and its application.
- A regularized simplex method
- Decomposition-aggregation method for convex programming problems
- Regularized optimization methods for convex MINLP problems
- A unifying polyhedral approximation framework for convex optimization
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A stable method for solving certain constrained least squares problems
- A weighted Gram-Schmidt method for convex quadratic programming
- An aggregate subgradient method for nonsmooth convex minimization
- Convex Analysis
- Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- Equivalence of some quadratic programming algorithms
- Finding the nearest point in a polytope
- Generalized upper bounding techniques
- scientific article; zbMATH DE number 3169929 (Why is no real title available?)
- scientific article; zbMATH DE number 3846333 (Why is no real title available?)
- scientific article; zbMATH DE number 3878686 (Why is no real title available?)
- scientific article; zbMATH DE number 4089324 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- Large-scale linearly constrained optimization
- Matrix augmentation and partitioning in the updating of the basis inverse
- Minimization methods for non-differentiable functions. Transl. from the Russian by K. C. Kiwiel and A. Ruszczyński
- Monotone Operators and the Proximal Point Algorithm
- Numerically stable methods for quadratic programming
- Primal partition programming for block diagonal matrices
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Solving stochastic programming problems with recourse including error bounds
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- Decomposition method of descent for minimizing the sum of convex nonsmooth functions
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs
- Accelerating the regularized decomposition method for two stage stochastic linear problems
- Modelling and analysis of multistage stochastic programming problems: A software environment
- Computational assessment of distributed decomposition methods for stochastic linear programs
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- Selected bibliography on degeneracy
- Multi-stage stochastic linear programs for portfolio optimization
- A regularized stochastic decomposition algorithm for two-stage stochastic linear programs
- On the rate of convergence of two minimax algorithms
- Sensitivity method for basis inverse representation in multistage stochastic linear programming problems
- Data parallel computing for network-structured optimization problems
- Finite master programs in regularized stochastic decomposition
- SLP-IOR: An interactive model management system for stochastic linear programs
- Cut sharing for multistage stochastic linear programs with interstage dependency
- Duality and statistical tests of optimality for two stage stochastic programs
- A parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs
- Decomposition methods in stochastic programming
- An approximation framework for two-stage ambiguous stochastic integer programs under mean-MAD information
- The Benders decomposition algorithm: a literature review
- Risk-averse two-stage stochastic programming with an application to disaster management
- Duality gaps in nonconvex stochastic optimization
- Applying the minimax criterion in stochastic recourse programs
- An improved L-shaped method for solving process flexibility design problems
- Parallel decomposition of multistage stochastic programming problems
- Epigraphical nesting: A unifying theory for the convergence of algorithms
- A stochastic optimization approach for robot scheduling
- An SQP algorithm for extended linear-quadratic problems in stochastic programming
- On the formulation of stochastic linear programs using algebraic modelling languages
- An enhanced decomposition algorithm for multistage stochastic hydroelectric scheduling
- On augmented Lagrangian decomposition methods for multistage stochastic programs
- Solving multistage stochastic network programs on massively prallel computers
- Scenario decomposition of risk-averse multistage stochastic programming problems
- Simulation-based confidence bounds for two-stage stochastic programs
- Combining stochastic programming and optimal control to decompose multistage stochastic optimization problems
- Inexact stochastic mirror descent for two-stage nonlinear stochastic programs
- Home service routing and appointment scheduling with stochastic service times
- Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization
- Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse
- Two-stage linear decision rules for multi-stage stochastic programming
- An ADMM algorithm for two-stage stochastic programming problems
- A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models
- Variance reduction for sequential sampling in stochastic programming
- Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse
- Heat and electricity market coordination: a scalable complementarity approach
- An augmented Lagrangian decomposition method for block diagonal linear programming problems
- Problems related to estimating the coefficients of exact penalty functions
- Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method
- Parallelizable preprocessing method for multistage stochastic programming problems
- A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
- Deviation measures in linear two-stage stochastic programming
- A probability metrics approach for reducing the bias of optimality gap estimators in two-stage stochastic linear programming
- On parallelizing dual decomposition in stochastic integer programming
- Solving two-stage stochastic programming problems with level decomposition
- Parallel interior-point solver for structured quadratic programs: Application to financial planning problems
- A stochastic programming approach for supply chain network design under uncertainty
- Assessing solution quality in stochastic programs
- Some insights into the solution algorithms for SLP problems
- Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
- Large-scale optimization with the primal-dual column generation method
- On a distributed implementation of a decomposition method for multistage linear stochastic programs
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
- Hierarchical benders decomposition for open-pit mine block sequencing
- Exact penalty functions and convex extensions of functions in schemes of decomposition in variables
- A regularized simplex method
- Optimization under Uncertainty via CometBoards
- The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences
- An embarrassingly parallel method for large-scale stochastic programs
- Recoverable robust single day aircraft maintenance routing problem
- Adaptive and nonadaptive approaches to statistically based methods for solving stochastic linear programs: a computational investigation
- Two-stage stochastic optimization problems with stochastic ordering constraints on the recourse
- A preconditioning technique for Schur complement systems arising in stochastic optimization
- Regularized decomposition of high-dimensional multistage stochastic programs with Markov uncertainty
- Portfolio choice models based on second-order stochastic dominance measures: an overview and a computational study
- On a dual method for a specially structured linear programming problem with application to stochastic programming
- An enhanced model for portfolio choice with SSD criteria: a constructive approach
- Improving the performance of stochastic dual dynamic programming
- Efficient Stochastic Programming in Julia
- Pebble Minimization of Polyregular Functions
- Stochastic Dynamic Linear Programming: A Sequential Sampling Algorithm for Multistage Stochastic Linear Programming
- Optimizing strategic planning in median systems subject to uncertain disruption and gradual recovery
- A selective linearization method for multiblock convex optimization
- Accelerating techniques on nested decomposition
- An adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse
- The Benders by batch algorithm: design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs
- Processing second-order stochastic dominance models using cutting-plane representations
- Stabilized Benders decomposition for energy planning under climate uncertainty
- Active set-based inexact proximal bundle algorithm for stochastic quadratic programming
- Bounding multi-stage stochastic programs from above
- A deep reinforcement learning framework for solving two-stage stochastic programs
- Stochastic red-blue set covering: a decomposition approach
- Optimizing surgery scheduling under post-anesthesia care unit capacity constraints and random services durations
- Bundle-enhanced column-and-constraint generation method for solving two-stage robust optimization problems
- Solving logic-based benders decomposition master problems with constraint programming and domain-independent dynamic programming
- Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization
- Exact methods for large-scale multi-period financial planning problems
- Proximity control in bundle methods for convex nondifferentiable minimization
- Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
This page was built for publication: A regularized decomposition method for minimizing a sum of polyhedral functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3735489)