Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems (Q354625): Difference between revisions

Latest revision as of 15:17, 9 December 2024

scientific article

Language	Label	Description	Also known as
English	Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems	scientific article

Statements

instance of

scholarly article

0 references

title

Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems (English)

0 references

0 references

0 references

0 references

Computational Optimization and Applications

0 references

publication date

19 July 2013

0 references

full work available at URL

https://arxiv.org/abs/1105.5427

0 references

zbMATH Keywords

excessive gap

0 references

smoothing technique

0 references

Lagrangian decomposition

0 references

proximal mappings

0 references

large-scale problem

0 references

separable convex optimization

0 references

distributed optimization

0 references

describes a project that uses

Ipopt

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q4001523

0 references

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

0 references

A proximal-based deomposition method for compositions method for convex minimization problems

0 references

Q3377692

0 references

Benchmarking optimization software with performance profiles.

0 references

Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling

0 references

On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators

0 references

Finite-Dimensional Variational Inequalities and Complementarity Problems

0 references

Fast Multiple-Splitting Algorithms for Convex Optimization

0 references

Two-level primal-dual proximal decomposition technique to solve large scale optimization problems

0 references

A Parallel Algorithm for a Class of Convex Programs

0 references

Decentralized Resource Allocation in Dynamic Networks of Agents

0 references

An alternating direction-based contraction method for linearly constrained separable convex programming problems

0 references

Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities

0 references

On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method

0 references

Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem

0 references

Mean value cross decomposition for nonlinear convex problems

0 references

A primal-dual infeasible-interior-point algorithm for linear programming

0 references

On the Implementation of a Primal-Dual Interior Point Method

0 references

Application of a Smoothing Technique to Decomposition in Convex Optimization

0 references

Distributed Subgradient Methods for Multi-Agent Optimization

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Excessive Gap Technique in Nonsmooth Convex Minimization

0 references

Smooth minimization of non-smooth functions

0 references

Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems

0 references

On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization

0 references

Applications of the method of partial inverses to convex programming: Decomposition

0 references

An Inexact Perturbed Path-Following Method for Lagrangian Decomposition in Large-Scale Separable Convex Optimization

0 references

Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities

0 references

Distributed Spectrum Management Algorithms for Multiuser DSL Networks

0 references

Improved Dual Decomposition Based Optimization for DSL Dynamic Spectrum Management

0 references

On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming

0 references

A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming

0 references

Identifiers

zbMATH Open document ID

1295.90048

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1007/S10589-012-9515-6

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:354625

@@ Property / DOI @@
-.1007/s10589-012-9515-6
@@ Property / DOI: 10.1007/s10589-012-9515-6 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2030224660
@@ Property / OpenAlex ID: W2030224660 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.5427
@@ Property / arXiv ID: 1105.5427 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4001523
@@ Property / cites work: Q4001523 / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
+Normal rank
@@ Property / cites work @@
+A proximal-based deomposition method for compositions method for convex minimization problems
+Normal rank
@@ Property / cites work @@
+Q3377692
@@ Property / cites work: Q3377692 / rank @@
+Normal rank
@@ Property / cites work @@
+Benchmarking optimization software with performance profiles.
+Normal rank
@@ Property / cites work @@
+Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
+Normal rank
@@ Property / cites work @@
+On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
+Normal rank
@@ Property / cites work @@
+Finite-Dimensional Variational Inequalities and Complementarity Problems
+Normal rank
@@ Property / cites work @@
+Fast Multiple-Splitting Algorithms for Convex Optimization
+Normal rank
@@ Property / cites work @@
+Two-level primal-dual proximal decomposition technique to solve large scale optimization problems
+Normal rank
@@ Property / cites work @@
+A Parallel Algorithm for a Class of Convex Programs
+Normal rank
@@ Property / cites work @@
+Decentralized Resource Allocation in Dynamic Networks of Agents
+Normal rank
@@ Property / cites work @@
+An alternating direction-based contraction method for linearly constrained separable convex programming problems
+Normal rank
@@ Property / cites work @@
+Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
+Normal rank
@@ Property / cites work @@
+On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
+Normal rank
@@ Property / cites work @@
+Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
+Normal rank
@@ Property / cites work @@
+Mean value cross decomposition for nonlinear convex problems
+Normal rank
@@ Property / cites work @@
+A primal-dual infeasible-interior-point algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+On the Implementation of a Primal-Dual Interior Point Method
+Normal rank
@@ Property / cites work @@
+Application of a Smoothing Technique to Decomposition in Convex Optimization
+Normal rank
@@ Property / cites work @@
+Distributed Subgradient Methods for Multi-Agent Optimization
+Normal rank
@@ Property / cites work @@
+Introductory lectures on convex optimization. A basic course.
+Normal rank
@@ Property / cites work @@
+Excessive Gap Technique in Nonsmooth Convex Minimization
+Normal rank
@@ Property / cites work @@
+Smooth minimization of non-smooth functions
@@ Property / cites work: Smooth minimization of non-smooth functions / rank @@
+Normal rank
@@ Property / cites work @@
+Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
+Normal rank
@@ Property / cites work @@
+On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
+Normal rank
@@ Property / cites work @@
+Applications of the method of partial inverses to convex programming: Decomposition
+Normal rank
@@ Property / cites work @@
+An Inexact Perturbed Path-Following Method for Lagrangian Decomposition in Large-Scale Separable Convex Optimization
+Normal rank
@@ Property / cites work @@
+Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
+Normal rank
@@ Property / cites work @@
+Distributed Spectrum Management Algorithms for Multiuser DSL Networks
+Normal rank
@@ Property / cites work @@
+Improved Dual Decomposition Based Optimization for DSL Dynamic Spectrum Management
+Normal rank
@@ Property / cites work @@
+On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
+Normal rank
@@ Property / cites work @@
+A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming
+Normal rank
@@ Property / DOI @@
+.1007/S10589-012-9515-6
@@ Property / DOI: 10.1007/S10589-012-9515-6 / rank @@
+Normal rank