Coordinate-update algorithms can efficiently detect infeasible optimization problems
From MaRDI portal
Cites work
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A block coordinate variable metric forward-backward algorithm
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
- A coordinate gradient descent method for nonsmooth separable minimization
- A coordinate-descent primal-dual algorithm with large step size and possibly nonseparable functions
- A cyclic coordinate-update fixed point algorithm
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A generalization of the Friedrichs angle and the method of alternating projections
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- A new projection method for finding the closest point in the intersection of convex sets
- A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- A Proximal Gradient Algorithm for Decentralized Composite Optimization
- A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- Accelerated, parallel, and proximal coordinate descent
- Alternating proximal gradient method for sparse nonnegative Tucker decomposition
- Analyzing random permutations for cyclic coordinate descent
- ARock: an algorithmic framework for asynchronous parallel coordinate updates
- Asymptotic behavior of averaged and firmly nonexpansive mappings in geodesic spaces
- Asymptotic behavior of contractions in Banach spaces
- Asymptotic behavior of contractions in Hilbert space
- Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
- Asynchronous stochastic coordinate descent: parallelism and convergence properties
- Circumcentering the Douglas-Rachford method
- Comments on the cosmic convergence of nonexpansive maps
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Coordinate descent algorithms
- Coordinate descent with arbitrary sampling. I: Algorithms and complexity.
- Cosmic divergence, weak cosmic convergence, and fixed points at infinity
- COSMO: a conic operator splitting method for convex conic problems
- Cyclic coordinate-update algorithms for fixed-point problems: analysis and applications
- Distributed average consensus with least-mean-square deviation
- Douglas-Rachford splitting and ADMM for pathological convex optimization
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Efficiency of the accelerated coordinate descent method on structured optimization problems
- Error bounds for the method of alternating projections
- Fast best subset selection: coordinate descent and local combinatorial optimization algorithms
- Fastest Mixing Markov Chain on a Graph
- Firmly nonexpansive mappings in classes of geodesic spaces
- Generalized solutions for the sum of two maximally monotone operators
- Global and local structure preserving sparse subspace learning: an iterative approach to unsupervised feature selection
- scientific article; zbMATH DE number 3919670 (Why is no real title available?)
- scientific article; zbMATH DE number 3671159 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 1009689 (Why is no real title available?)
- scientific article; zbMATH DE number 3449561 (Why is no real title available?)
- scientific article; zbMATH DE number 878830 (Why is no real title available?)
- Infeasibility detection in the alternating direction method of multipliers for convex optimization
- Iteration complexity analysis of block coordinate descent methods
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Local convergence properties of Douglas-Rachford and alternating direction method of multipliers
- Local linear convergence analysis of primal-dual splitting methods
- Method of cyclic descent in the problem of best approximation
- Minimizing Certain Convex Functions
- Minimizing finite sums with the stochastic average gradient
- On a result of Pazy concerning the asymptotic behaviour of nonexpansive mappings
- On certain inequalities and characteristic value problems for analytic functions and for functions of two variables.
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the asymptotic behavior of nonlinear semigroups and the range of accretive operators
- On the asymptotic behavior of nonlinear semigroups and the range of accretive operators. II
- On the asymptotic behavior of the Douglas-Rachford and proximal-point algorithms for convex optimization
- On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint
- On the complexity analysis of randomized block-coordinate descent methods
- On the convergence of block coordinate descent type methods
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- On the convergence of the coordinate descent method for convex differentiable minimization
- On the Douglas–Rachford Algorithm for Solving Possibly Inconsistent Optimization Problems
- On the minimal displacement vector of compositions and convex combinations of nonexpansive mappings
- On the minimal displacement vector of the Douglas-Rachford operator
- On the weak convergence of an ergodic iteration for the solution of variational inequalities for monotone operators in Hilbert space
- Operator splitting for a homogeneous embedding of the linear complementarity problem
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
- Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces
- OSQP: an operator splitting solver for quadratic programs
- Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis
- Random permutations fix a worst case for cyclic coordinate descent
- Random Relaxation of Fixed-Point Iteration
- Random reordering in SOR-type methods
- Randomness and permutations in coordinate descent methods
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping. II: Mean-square and linear convergence
- The Asymptotic Behavior of Firmly Nonexpansive Mappings
- The asymptotics of nonexpansive iterations
- The blockwise coordinate descent method for integer programs
- The Douglas-Rachford algorithm for two (not necessarily intersecting) affine subspaces
- The Douglas-Rachford algorithm in the affine-convex case
- The magnitude of the minimal displacement vector for compositions and convex combinations of firmly nonexpansive mappings
- The optimal error bound for the method of simultaneous projections
- The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
- The solution by iteration of nonlinear functional equations in Banach spaces
- Theory of Reproducing Kernels
- Tight Global Linear Convergence Rate Bounds for Operator Splitting Methods
- Worst-case complexity of cyclic coordinate descent: O(n^2) gap with randomized version
This page was built for publication: Coordinate-update algorithms can efficiently detect infeasible optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7031715)
