Pages that link to "Item:Q122993"

The following pages link to Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers (Q122993):

Displaying 50 items.

• Time-optimal hands-off control for linear time-invariant systems (Q1716632) (← links)
• Detection and mitigation of biasing attacks on distributed estimation networks (Q1716683) (← links)
• A modified strictly contractive peaceman-Rachford splitting method for multi-block separable convex programming (Q1716951) (← links)
• Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights (Q1717220) (← links)
• Distributed optimization with closed convex set for multi-agent networks over directed graphs (Q1717465) (← links)
• Bound alternative direction optimization for image deblurring (Q1717868) (← links)
• Sensitivity analysis of the proximal-based parallel decomposition methods (Q1719313) (← links)
• Total variation image restoration method based on subspace optimization (Q1721308) (← links)
• Real-time pricing for demand response in smart grid based on alternating direction method of multipliers (Q1721584) (← links)
• Query-dependent ranking and its asymptotic properties (Q1722064) (← links)
• A two-stage regularization method for variable selection and forecasting in high-order interaction model (Q1723055) (← links)
• An implementable first-order primal-dual algorithm for structured convex optimization (Q1724030) (← links)
• Enhancing matrix completion using a modified second-order total variation (Q1727032) (← links)
• Distributed adaptive dynamic programming for data-driven optimal control (Q1729050) (← links)
• Distributed constrained optimization for multi-agent networks with nonsmooth objective functions (Q1729131) (← links)
• Event-driven optimal control for a robotic exploration, pick-up and delivery problem (Q1730345) (← links)
• On Glowinski's open question on the alternating direction method of multipliers (Q1730806) (← links)
• Envelope functions: unifications and further properties (Q1730819) (← links)
• Distributed constraint optimization on networked multi-agent systems (Q1732839) (← links)
• Deblurring Poisson noisy images by total variation with overlapping group sparsity (Q1733626) (← links)
• Proximal alternating penalty algorithms for nonsmooth constrained convex optimization (Q1734766) (← links)
• Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis (Q1734769) (← links)
• Convergence of the augmented decomposition algorithm (Q1734773) (← links)
• Robust \(L_p\)-norm least squares support vector regression with feature selection (Q1735423) (← links)
• A nonstationary accelerating alternating direction method for frame-based Poissonian image deblurring (Q1736364) (← links)
• Alternating iterative methods for solving tensor equations with applications (Q1736417) (← links)
• Alternating direction method of multipliers for generalized low-rank tensor recovery (Q1736785) (← links)
• Distributed optimization over directed graphs with row stochasticity and constraint regularity (Q1737783) (← links)
• Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers (Q1737796) (← links)
• Optimal graph Laplacian (Q1737851) (← links)
• A classification point-of-view about conditional Kendall's tau (Q1738003) (← links)
• Subspace-based spectrum estimation in innovation models by mixed norm minimization (Q1738593) (← links)
• A distributed one-step estimator (Q1739027) (← links)
• Level-set methods for convex optimization (Q1739042) (← links)
• Modification of TV-ROF denoising model based on split Bregman iterations (Q1740170) (← links)
• ADMM for the SDP relaxation of the QAP (Q1741118) (← links)
• New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
• Linear convergence rates for variants of the alternating direction method of multipliers in smooth cases (Q1743535) (← links)
• Robust bilinear factorization with missing and grossly corrupted observations (Q1749100) (← links)
• Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing (Q1749455) (← links)
• An efficient alternating direction method of multipliers for optimal control problems constrained by random Helmholtz equations (Q1751062) (← links)
• Optimal estimation of slope vector in high-dimensional linear transformation models (Q1755121) (← links)
• On inexact ADMMs with relative error criteria (Q1756581) (← links)
• An FE-inexact heterogeneous ADMM for elliptic optimal control problems with \(L^1\)-control cost (Q1757721) (← links)
• Risk estimators for choosing regularization parameters in ill-posed problems -- properties and limitations (Q1785032) (← links)
• Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems (Q1785469) (← links)
• Improved proximal ADMM with partially parallel splitting for multi-block separable convex programming (Q1786947) (← links)
• Large-scale hyperspectral image compression via sparse representations based on online learning (Q1787085) (← links)
• Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach (Q1787322) (← links)
• A fully distributed asynchronous approach for multi-area coordinated network-constrained unit commitment (Q1787329) (← links)