scientific article; zbMATH DE number 6378119
From MaRDI portal
Publication:2934047
Recommendations
- scientific article; zbMATH DE number 3912113
- Iteration complexity of a block coordinate gradient descent method for convex optimization
- Iteration-complexity of first-order penalty methods for convex programming
- Iterative algorithm for a convex feasibility problem
- scientific article; zbMATH DE number 3892945
- Iterative algorithm for solving a class of convex feasibility problem
- Iterative Approaches to Convex Minimization Problems
- Iteration methods to compute the separable convex minimization problems
- On lower iteration complexity bounds for the convex concave saddle point problems
- A general iterative scheme with applications to convex optimization and related fields
Cited in
(40)- Incremental learning for \(\nu\)-support vector regression
- Consistent algorithms for multiclass classification with an abstain option
- Stochastic block-coordinate gradient projection algorithms for submodular maximization
- Multi-label Lagrangian support vector machine with random block coordinate descent method
- New characterizations of Hoffman constants for systems of linear constraints
- Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems
- Convergence results of a nested decentralized gradient method for non-strongly convex problems
- Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity
- Efficient iterative method for SOAV minimization problem with linear equality and box constraints and its linear convergence
- Convergence results of a new monotone inertial forward-backward splitting algorithm under the local Hölder error bound condition
- Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis
- Randomness and permutations in coordinate descent methods
- Augmented Lagrangian optimization under fixed-point arithmetic
- Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM
- New analysis of linear convergence of gradient-type methods via unifying error bound conditions
- Restarting the accelerated coordinate descent method with a rough strong convexity estimate
- Linearly convergent away-step conditional gradient for non-strongly convex functions
- Linear convergence of first order methods for non-strongly convex optimization
- Projection onto a polyhedron that exploits sparsity
- Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions
- On the iteration complexity of cyclic coordinate gradient descent methods
- Linear convergence of randomized feasible descent methods under the weak strong convexity assumption
- A block successive upper-bound minimization method of multipliers for linearly constrained convex optimization
- Parallel random coordinate descent method for composite minimization: convergence analysis and error bounds
- RSG: Beating Subgradient Method without Smoothness and Strong Convexity
- scientific article; zbMATH DE number 6982986 (Why is no real title available?)
- On the complexity analysis of the primal solutions for the accelerated randomized dual coordinate ascent
- The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth
- Accelerate stochastic subgradient method by leveraging local growth condition
- Iteration complexity of a block coordinate gradient descent method for convex optimization
- Nonlinear optimization and support vector machines
- Nonlinear optimization and support vector machines
- An aggressive reduction on the complexity of optimization for non-strongly convex objectives
- Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems
- An easily computable upper bound on the Hoffman constant for homogeneous inequality systems
- Proximal gradient methods with inexact oracle of degree q for composite optimization
- A generalization of Hoffman's lemma in Banach spaces and applications
- Iterative regularization in classification via hinge loss diagonal descent
- Duality of Hoffman constants
- Distributed block-diagonal approximation methods for regularized empirical risk minimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934047)
