Distributed algorithms for convex problems with linear coupling constraints
From MaRDI portal
Publication:2173513
Recommendations
- An augmented Lagrangian method for distributed optimization
- An augmented Lagrangian based algorithm for distributed nonconvex optimization
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
- Cluster-based distributed augmented Lagrangian algorithm for a class of constrained convex optimization problems
- Augmented Lagrangian tracking for distributed optimization with equality and inequality coupling constraints
Cites work
- A canonical duality approach for the solution of affine quasi-variational inequalities
- A convergent decomposition algorithm for support vector machines
- Algorithms for generalized potential games with mixed-integer variables
- An augmented Lagrangian function with improved exactness properties
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
- Convex optimization algorithms
- Decentralized dictionary learning over time-varying digraphs
- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Exploiting structure in parallel implementation of interior point methods for optimization
- Generalized Nash equilibrium problems
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 1215260 (Why is no real title available?)
- scientific article; zbMATH DE number 1552021 (Why is no real title available?)
- Hybrid MPI/OpenMP parallel linear support vector machine training
- New results on a class of exact augmented Lagrangians
- Nonlinear optimization and support vector machines
- On the computation of all solutions of jointly convex generalized Nash equilibrium problems
- On the convergence of inexact block coordinate descent methods for constrained optimization
- On the linear convergence of the alternating direction method of multipliers
- Parallel and Distributed Methods for Constrained Nonconvex Optimization-Part II: Applications in Communications and Machine Learning
- Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory
- Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training
- Parallel Selective Algorithms for Nonconvex Big Data Optimization
- Practical augmented Lagrangian methods for constrained optimization
- Sufficient conditions to compute any solution of a quasivariational inequality via a variational inequality
- The semismooth Newton method for the solution of quasi-variational inequalities
Cited in
(8)- Decentralized online integer programming problems with a coupling cardinality constraint
- Distributed convex optimization algorithms and their application to distributed control in peer-to-peer data storage system
- Distributed solutions for loosely coupled feasibility problems using proximal splitting methods
- Concurrent forward bounding for distributed constraint optimization problems
- Distributed Semidefinite Programming With Application to Large-Scale System Analysis
- Distributed Algorithm for Solving Convex Inequalities
- Input–Output Performance of Linear–Quadratic Saddle-Point Algorithms With Application to Distributed Resource Allocation Problems
- Distributed Optimization With Coupling Constraints
This page was built for publication: Distributed algorithms for convex problems with linear coupling constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2173513)
