Primal convergence from dual subgradient methods for convex optimization
From MaRDI portal
Publication:2340335
Recommendations
- Primal-dual subgradient methods for convex problems
- On the convergence of a dual-primal substructuring method
- Ergodic, primal convergence in dual subgradient schemes for convex programming
- On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems
- scientific article; zbMATH DE number 124640
- A primal-dual approach to inexact subgradient methods
- A class of convergent primal-dual subgradient algorithms for decomposable convex programs
- Convergence of the primal-dual Newton method for linear programming problems
Cites work
- 0-1 reformulations of the multicommodity capacitated network design problem
- A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
- A dual scheme for traffic assignment problems
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
- A Lagrangian-based heuristic for large-scale set covering problems
- A note on two problems in connexion with graphs
- A survey of algorithms for convex multicommodity flow problems
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems: a corrigendum
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Benchmarking optimization software with performance profiles.
- Convergence analysis of deflected conditional approximate subgradient methods
- Ergodic, primal convergence in dual subgradient schemes for convex programming
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 3116771 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3431955 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- Lagrangian Relaxation via Ballstep Subgradient Methods
- Minimization of unsmooth functionals
- New variants of bundle methods
- On embedding the volume algorithm in a variable target value method.
- Origin-Based Algorithm for the Traffic Assignment Problem
- Primal-dual subgradient methods for convex problems
- Proximity control in bundle methods for convex nondifferentiable minimization
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Subgradient methods for saddle-point problems
- The efficiency of ballstep subgradient level methods for convex optimization
- The volume algorithm revisited: relation with bundle methods
- The volume algorithm: Producing primal solutions with a subgradient method
- Two ``well-known properties of subgradient optimization
Cited in
(22)- Nonlinear least square based on control direction by dual method and its application
- A primal-dual approach to inexact subgradient methods
- Ergodic, primal convergence in dual subgradient schemes for convex programming
- A unitary distributed subgradient method for multi-agent optimization with different coupling sources
- Primal recovery from consensus-based dual decomposition for distributed convex optimization
- Iteration complexity analysis of dual first-order methods for conic convex programming
- Convergence analysis of approximate primal solutions in dual first-order methods
- A class of convergent primal-dual subgradient algorithms for decomposable convex programs
- Constrained ?-subgradient method for simultaneous solution of the primal and dual problems of convex programming
- On the Convergence Time of Dual Subgradient Methods for Strongly Convex Programs
- Coordinate Descent Face-Off: Primal or Dual?
- On the convergence rate of a forward-backward type primal-dual splitting algorithm for convex optimization problems
- Planning online advertising using Gini indices
- scientific article; zbMATH DE number 6409510 (Why is no real title available?)
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems
- Consensus-based Dantzig-Wolfe decomposition
- A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution
- Distributed dual subgradient methods with averaging and applications to grid optimization
- Some primal-dual theory for subgradient methods for strongly convex optimization
- Dual subgradient method with averaging for optimal resource allocation
- An inexact primal-dual algorithm for semi-infinite programming
- Convergence properties of a randomized primal-dual algorithm with applications to parallel MRI
This page was built for publication: Primal convergence from dual subgradient methods for convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340335)
