Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
From MaRDI portal
Publication:5189564
DOI10.1137/080718814zbMath1187.90222OpenAlexW2159434603WikidataQ118165491 ScholiaQ118165491MaRDI QIDQ5189564
Giacomo D'Antonio, Antonio Frangioni
Publication date: 17 March 2010
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://eprints.adm.unipi.it/601/1/DeflProjSubG.pdf
convergence analysisLagrangian relaxationconvex programmingnondifferentiable optimizationbackpropagationsubgradient methods
Related Items
On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions, Inexact subgradient methods for quasi-convex optimization problems, Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support, Using projected cutting planes in the extended cutting plane method, Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations, A Lagrangian propagator for artificial neural networks in constraint programming, A stabilized structured Dantzig-Wolfe decomposition method, A storm of feasibility pumps for nonconvex MINLP, A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information, A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, Incremental Bundle Methods using Upper Models, A partially inexact bundle method for convex semi-infinite minmax problems, A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information, An infeasible-point subgradient method using adaptive approximate projections, A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods, Large-scale unit commitment under uncertainty: an updated literature survey, Dynamic smoothness parameter for fast gradient methods, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, A proximal bundle method for nonsmooth nonconvex functions with inexact information, Essentials of numerical nonsmooth optimization, Scaling Techniques for $\epsilon$-Subgradient Methods, Abstract convergence theorem for quasi-convex optimization problems with applications, On the convergence of the forward–backward splitting method with linesearches, Weak subgradient method for solving nonsmooth nonconvex optimization problems, Primal convergence from dual subgradient methods for convex optimization, Essentials of numerical nonsmooth optimization, Large-scale unit commitment under uncertainty, Solving Basis Pursuit, A library for continuous convex separable quadratic knapsack problems
