Potential reduction method for harmonically convex programming (Q1893464): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5540119 / 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: Q4735039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point methods for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3827797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems / 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: Conical projection algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiplicative barrier function method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the polynomiality of the Iri-Imai method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence property of the Iri-Imai algorithm for some smooth convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior point algorithms for linear programming with inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming / rank
 
Normal rank

Latest revision as of 14:13, 23 May 2024

scientific article
Language Label Description Also known as
English
Potential reduction method for harmonically convex programming
scientific article

    Statements

    Potential reduction method for harmonically convex programming (English)
    0 references
    13 December 1995
    0 references
    harmonic convexity
    0 references
    polynomiality
    0 references
    potential reduction method
    0 references
    \(\varepsilon\)-optimal solution
    0 references
    0 references
    0 references

    Identifiers