On the convergence of a class of outer approximation algorithms for convex programs (Q789154): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Newton's method for convex programming and Tschebyscheff approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Outer Approximation Algorithm for Solving General Convex Programs / 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: An approach to nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4173599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate cutting planes in nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4094660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Supporting Hyperplane Method for Unimodal Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Conditions for Nonlinear Programming Algorithms / rank
 
Normal rank

Latest revision as of 10:55, 14 June 2024

scientific article
Language Label Description Also known as
English
On the convergence of a class of outer approximation algorithms for convex programs
scientific article

    Statements

    On the convergence of a class of outer approximation algorithms for convex programs (English)
    0 references
    0 references
    1984
    0 references
    convergence
    0 references
    subgradient
    0 references
    outer approximation methods
    0 references
    cutting plane method
    0 references
    supporting hyperplane method
    0 references

    Identifiers