Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming (Q1327215): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Olivier Bahn / rank
Normal rank
 
Property / author
 
Property / author: Jean-Louis Goffin / rank
Normal rank
 
Property / author
 
Property / author: Olivier Bahn / rank
 
Normal rank
Property / author
 
Property / author: Jean-Louis Goffin / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ACCPM / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Matlab / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's method for convex programming and Tschebyscheff approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5557595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial Newton method for linear programming / 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: Using central prices in the decomposition of linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting planes and column generation techniques with the projective algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of weighted analytic centers and dual ellipsoids 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: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving combinatorial optimization problems using Karmarkar's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738934 / rank
 
Normal rank

Latest revision as of 16:30, 22 May 2024

scientific article
Language Label Description Also known as
English
Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
scientific article

    Statements

    Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 July 1994
    0 references
    0 references
    interior point cutting plane algorithm
    0 references
    convex differentiable programming
    0 references
    0 references
    0 references