Complexity estimates of some cutting plane methods based on the analytic barrier (Q1922694): 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: A cutting plane algorithm for convex programming that uses analytic centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm / 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: Q4182272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location of the Maximum on Unimodal Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm, based on Newton's method, for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for minimizing convex functions over convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Potential Reduction Algorithm Allowing Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4097094 / rank
 
Normal rank

Latest revision as of 14:32, 24 May 2024

scientific article
Language Label Description Also known as
English
Complexity estimates of some cutting plane methods based on the analytic barrier
scientific article

    Statements

    Complexity estimates of some cutting plane methods based on the analytic barrier (English)
    0 references
    0 references
    0 references
    18 September 1996
    0 references
    0 references
    nonsmooth optimization
    0 references
    self-concordant functions
    0 references
    efficiency estimates
    0 references
    cutting plane methods
    0 references
    analytic barrier
    0 references
    rate of convergence
    0 references
    0 references