Efficient iterative method for SOAV minimization problem with linear equality and box constraints and its linear convergence
From MaRDI portal
Publication:2125304
Cites work
- A unified formulation and fast accelerated proximal gradient method for classification
- A unified framework for hybrid control: model and optimal control theory
- An \(\ell_1\)-penalized adaptive normalized quasi-Newton algorithm for sparsity-aware generalized eigen-subspace tracking
- Block-sparsity regularized maximum correntropy criterion for structured-sparse system identification
- Control of systems integrating logic, dynamics, and constraints
- Convex optimization theory.
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- Discrete-Valued Control of Linear Time-Invariant Systems by Sum-of-Absolute-Values Optimization
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- From error bounds to the complexity of first-order descent methods for convex functions
- scientific article; zbMATH DE number 6378119 (Why is no real title available?)
- scientific article; zbMATH DE number 781821 (Why is no real title available?)
- Iterative methods for linear systems. Theory and applications
- Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM
- Linear convergence of first order methods for non-strongly convex optimization
- Linearly convergent away-step conditional gradient for non-strongly convex functions
- Local R-linear convergence of ADMM-based algorithm for _1-norm minimization with linear and box constraints
- Mixed \(\ell_2\) and \(\ell_1\)-norm regularization for adaptive detrending with ARMA modeling
- Numerical recipes. The art of scientific computing.
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the linear convergence of the alternating direction method of multipliers
- Quadratic Model Predictive Control Including Input Cardinality Constraints
- Solving basis pursuit: heuristic optimality check and solver comparison
- Sparse adaptive channel estimation based on mixed controlled l₂ and l_p-norm error criterion
- Tight Global Linear Convergence Rate Bounds for Operator Splitting Methods
This page was built for publication: Efficient iterative method for SOAV minimization problem with linear equality and box constraints and its linear convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2125304)
