Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10957-008-9458-3 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072265605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A successive quadratic programming method for a class of constrained nonsmooth optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized proximal point algorithm for certain non-convex minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for minimizing the sum of a convex function and a continuously differentiable function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimization method for the sum of a convex function and a continuously differentiable function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coordinate gradient descent method for nonsmooth separable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ideal spatial adaptation by wavelet shrinkage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Regularization of Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwise coordinate optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a block coordinate descent method for nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the block nonlinear Gauss-Seidel method under convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Group Lasso for Logistic Regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time decomposition algorithms for support vector machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds and convergence analysis of feasible descent methods: A general approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Solution of Nonlinear Equations in Several Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for some separable quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear-time algorithms for the continuous quadratic Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ϵ-Out-of-Kilter Method for Monotropic Programming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10957-008-9458-3 / rank
 
Normal rank

Latest revision as of 13:05, 10 December 2024

scientific article
Language Label Description Also known as
English
Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
scientific article

    Statements

    Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (English)
    0 references
    5 May 2009
    0 references
    support vector machines
    0 references
    bilevel optimization
    0 references
    \(\ell_{1}\)-regularization
    0 references
    global convergence
    0 references
    linear convergence rate
    0 references
    complexity bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers