Divide to conquer: decomposition methods for energy optimization

From MaRDI portal
Publication:715247

DOI10.1007/s10107-012-0570-7zbMath1254.90238OpenAlexW1978005944MaRDI QIDQ715247

Michael Martin C. Sagastizábal

Publication date: 2 November 2012

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-012-0570-7




Related Items (28)

Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth OptimizationDecomposition algorithm for large-scale two-stage unit-commitmentConstrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problemsAn inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problemsA comparison of four approaches from stochastic programming for large-scale unit-commitmentOn the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problemsA distributionally ambiguous two-stage stochastic approach for investment in renewable generationA redistributed proximal bundle method for nonsmooth nonconvex functions with inexact informationOptimal Convergence Rates for the Proximal Bundle MethodA Lagrangian relaxation approach to an electricity system investment model with a high temporal resolutionAsynchronous level bundle methodsUnnamed ItemStochastic programming approach for energy management in electric microgridsLarge-scale unit commitment under uncertainty: an updated literature surveyDecomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitmentA regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programmingRegularized optimization methods for convex MINLP problemsA stabilised scenario decomposition algorithm applied to stochastic unit commitment problemsA strongly convergent proximal bundle method for convex minimization in Hilbert spacesDecomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower gamesDecomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valleyA proximal bundle method for nonsmooth nonconvex functions with inexact informationA proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact dataValuation and pricing of electricity delivery contracts: the producer's viewRevisiting augmented Lagrangian dualsLarge-scale unit commitment under uncertaintyOn Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact OracleTowards an objective feasibility pump for convex minlps


Uses Software


Cites Work


This page was built for publication: Divide to conquer: decomposition methods for energy optimization