Orthogonalizing linear operators in convex programming. I, II (Q1280891): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5655195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Metric Method for Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Rapidly Convergent Descent Method for Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4076680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3797760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3036155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(r\)-algorithms and ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Method of orthogonal descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical analysis of the orthogonal descent method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified orthogonal-descent algorithm for finding the zero of a complex function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4747461 / rank
 
Normal rank

Latest revision as of 17:56, 28 May 2024

scientific article
Language Label Description Also known as
English
Orthogonalizing linear operators in convex programming. I, II
scientific article

    Statements

    Orthogonalizing linear operators in convex programming. I, II (English)
    0 references
    0 references
    28 April 1999
    0 references
    convex optimization
    0 references
    subgradient method
    0 references
    one-rank linear operators
    0 references
    space transformations
    0 references
    Fejer-type subgradient methods
    0 references
    convex function
    0 references

    Identifiers