On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q56451839 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity-preserving SOR algorithms for separable quadratic and linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4171875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of large, structured linear complementarity problems: the block partitioned case / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for computing the capacity of arbitrary discrete memoryless channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of channel capacity and rate-distortion functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel application of block-iterative methods in medical imaging and radiation therapy / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for maximizing entropy subject to simple bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Iterative Scaling for Log-Linear Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5540119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of a block successive over-relaxation method for a class of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparative Study of Algorithms for Matrix Balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector and parallel computing for matrix balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of “$\log x$” Entropy over Linear Equality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3321366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On search directions for minimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of sequential minimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5591247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition algorithm for convex differentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5580053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation Methods for Network Flow Problems with Convex Arc Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation methods for problems with strictly convex separable costs and linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for error in the solution set of a perturbed linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems / 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: Iterative Methods for Large Convex Quadratic Programs: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence properties of Hildreth's quadratic programming algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxed version of Bregman's method for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative row-action method for interval convex programming / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00939948 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013850411 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:33, 30 July 2024

scientific article
Language Label Description Also known as
English
On the convergence of the coordinate descent method for convex differentiable minimization
scientific article

    Statements

    On the convergence of the coordinate descent method for convex differentiable minimization (English)
    0 references
    0 references
    0 references
    27 April 1994
    0 references
    coordinate descent method
    0 references
    convex differentiable minimization
    0 references
    symmetric monotone linear complementarity
    0 references
    matrix balancing
    0 references
    entropy optimization
    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