Pages that link to "Item:Q3648529"
From MaRDI portal
The following pages link to Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods (Q3648529):
Displaying 50 items.
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080) (← links)
- Primal recovery from consensus-based dual decomposition for distributed convex optimization (Q255083) (← links)
- A decomposition method for large scale MILPs, with performance guarantees and a power system application (Q259426) (← links)
- Distributed continuous-time approximate projection protocols for shortest distance optimization problems (Q286313) (← links)
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677) (← links)
- Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization (Q519779) (← links)
- Dual subgradient method with averaging for optimal resource allocation (Q723992) (← links)
- An inexact primal-dual algorithm for semi-infinite programming (Q784788) (← links)
- Computational complexity certification for dual gradient method: application to embedded MPC (Q894005) (← links)
- Distributed robust adaptive equilibrium computation for generalized convex games (Q901177) (← links)
- Subgradient methods for saddle-point problems (Q1035898) (← links)
- Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation (Q1626886) (← links)
- Dual decomposition for multi-agent distributed optimization with coupling constraints (Q1680912) (← links)
- On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems (Q1689375) (← links)
- A decentralized approach to multi-agent MILPs: finite-time feasibility and performance guarantees (Q1737812) (← links)
- An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians (Q1955564) (← links)
- A feasibility-ensured Lagrangian heuristic for general decomposable problems (Q2068837) (← links)
- Parallel subgradient algorithm with block dual decomposition for large-scale optimization (Q2077960) (← links)
- A primal-dual algorithm for risk minimization (Q2133418) (← links)
- Stochastic approximation method using diagonal positive-definite matrices for convex optimization with fixed point constraints (Q2138441) (← links)
- A unitary distributed subgradient method for multi-agent optimization with different coupling sources (Q2174029) (← links)
- Augmented Lagrangian optimization under fixed-point arithmetic (Q2208540) (← links)
- Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming (Q2220658) (← links)
- Sparse regression: scalable algorithms and empirical performance (Q2225311) (← links)
- Large-scale dynamic system optimization using dual decomposition method with approximate dynamic programming (Q2242993) (← links)
- Exponential convergence of distributed primal-dual convex optimization algorithm without strong convexity (Q2280701) (← links)
- Decentralized hierarchical constrained convex optimization (Q2303528) (← links)
- Primal convergence from dual subgradient methods for convex optimization (Q2340335) (← links)
- Certification aspects of the fast gradient method for solving the dual of parametric convex programs (Q2392808) (← links)
- Submodular functions: from discrete to continuous domains (Q2414912) (← links)
- Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods (Q2429403) (← links)
- Distributed optimal resource allocation over strongly connected digraphs: a surplus-based approach (Q2663958) (← links)
- Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs (Q2665379) (← links)
- An online convex optimization-based framework for convex bilevel optimization (Q2693650) (← links)
- A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems (Q2795104) (← links)
- Complexity Certifications of First-Order Inexact Lagrangian Methods for General Convex Programming: Application to Real-Time MPC (Q2798546) (← links)
- Iteration complexity analysis of dual first-order methods for conic convex programming (Q2815553) (← links)
- Convergence Analysis of Approximate Primal Solutions in Dual First-Order Methods (Q2834559) (← links)
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming (Q4622887) (← links)
- Weak subgradient method for solving nonsmooth nonconvex optimization problems (Q5009157) (← links)
- First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems (Q5097011) (← links)
- Online First-Order Framework for Robust Convex Optimization (Q5131545) (← links)
- Generalized maximum entropy estimation (Q5214230) (← links)
- A Simple Parallel Algorithm with an $O(1/t)$ Convergence Rate for General Convex Programs (Q5737727) (← links)
- An adaptive constraint tightening approach to linear model predictive control based on approximation algorithms for optimization (Q5745041) (← links)
- Distributed algorithm for nonsmooth multi-coalition games and its application in electricity markets (Q6119755) (← links)
- Distributed robust optimization with coupled constraints via Tseng's splitting method (Q6136117) (← links)
- Seeking strategy design for distributed nonsmooth games and its application (Q6136801) (← links)
- Consensus-based Dantzig-Wolfe decomposition (Q6167387) (← links)
- Distributed inertial online game algorithm for tracking generalized Nash equilibria (Q6552805) (← links)
