Restricted simplicial decomposition for convex constrained problems (Q2366609): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5668259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Goldstein-Levitin-Polyak gradient projection method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected Newton Methods for Optimization Problems with Simple Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5535370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted simplicial decomposition: Computation and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finiteness in restricted simplicial decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming / rank
 
Normal rank

Latest revision as of 18:14, 17 May 2024

scientific article
Language Label Description Also known as
English
Restricted simplicial decomposition for convex constrained problems
scientific article

    Statements

    Restricted simplicial decomposition for convex constrained problems (English)
    0 references
    0 references
    0 references
    0 references
    30 August 1993
    0 references
    0 references
    global convergence
    0 references
    restricted simplicial decomposition
    0 references
    convex constraints
    0 references