A ladder method for linear semi-infinite programming (Q380573): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.3934/jimo.2014.10.397 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3934/jimo.2014.10.397 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997096856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of the simplex algorithm for semi-infinite linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An accelerated central cutting plane algorithm for linear semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logarithmic barrier cutting plane method for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior point algorithm for semi-infinite linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4357206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5494164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3668370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation of a discretization method for semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Infinite Programming: Theory, Methods, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual parametrization method for convex semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal interior point method for convex semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exterior point linear programming method based on inclusive normal cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in linear programming: from trichotomy to quadrichotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bridging method for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new quadratic semi-infinite programming algorithm based on dual parametrization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discretization methods for the solution of semi-infinite programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3720311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed cutting plane method for solving linear semi-infinite programming problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.3934/JIMO.2014.10.397 / rank
 
Normal rank

Latest revision as of 16:52, 9 December 2024

scientific article
Language Label Description Also known as
English
A ladder method for linear semi-infinite programming
scientific article

    Statements

    A ladder method for linear semi-infinite programming (English)
    0 references
    0 references
    0 references
    14 November 2013
    0 references
    linear semi-infinite programming
    0 references
    inclusive cone
    0 references
    ladder
    0 references
    optimality
    0 references
    algorithm
    0 references

    Identifiers