On the classical logarithmic barrier function method for a class of smooth convex programming problems (Q1321158): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Dick den Hertog / rank
Normal rank
 
Property / author
 
Property / author: Cornelis Roos / rank
Normal rank
 
Property / author
 
Property / author: Tamás Terlaky / rank
Normal rank
 
Property / author
 
Property / author: Dick den Hertog / rank
 
Normal rank
Property / author
 
Property / author: Cornelis Roos / rank
 
Normal rank
Property / author
 
Property / author: Tamás Terlaky / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4066855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5540119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5653783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685869 / 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: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method / 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: 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 potential-reduction variant of Renegar's short-step path-following method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the method of analytic centers when applied to convex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995706 / 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 duality theorem for non-linear programming / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00940075 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972639694 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:34, 30 July 2024

scientific article
Language Label Description Also known as
English
On the classical logarithmic barrier function method for a class of smooth convex programming problems
scientific article

    Statements

    On the classical logarithmic barrier function method for a class of smooth convex programming problems (English)
    0 references
    27 April 1994
    0 references
    interior point method
    0 references
    Newton method
    0 references
    logarithmic barrier function method
    0 references
    smooth convex programming
    0 references
    0 references
    0 references
    0 references

    Identifiers