A new linesearch method for quadratically constrained convex programming (Q1342277): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A New Method for Optimal Truss Topology Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems / 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: Generation of degenerate linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5540119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735039 / 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 Variable Reduction Method for Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line Search Procedures for the Logarithmic Barrier Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified barrier functions (theory and methods) / 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: Unified complexity analysis for Newton LP methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achievable potential reductions in the method of Kojima et al. in the case of linear programming / rank
 
Normal rank

Latest revision as of 11:22, 23 May 2024

scientific article
Language Label Description Also known as
English
A new linesearch method for quadratically constrained convex programming
scientific article

    Statements

    A new linesearch method for quadratically constrained convex programming (English)
    0 references
    17 January 1996
    0 references
    linesearch
    0 references
    step optimization
    0 references
    interior point methods
    0 references
    quadratic objective function
    0 references
    quadratic constraints
    0 references
    transformed derivative
    0 references
    improved Newton method
    0 references
    0 references

    Identifiers