Canonical DC programming problem: Outer approximation methods revisited (Q1919172): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A level set algorithm for a class of reverse convex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on a reverse convex programming algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line and off-line vertex enumeration by adjacency lists / 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: A Successive Underestimation Method for Concave Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite cutting plane method for solving linear programs with an additional reverse convex constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for globally minimizing concave functions over convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding new vertices and redundant constraints in cutting plane algorithms for global optimization / 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: Q5638112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer approximation method for globally minimizing a concave function over a compact convex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified version of Tuy's method for solving d.c. programing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On outer approximation methods for solving concave minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3761588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex programs with an additional reverse convex constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Supporting Hyperplane Method for Unimodal Programming / rank
 
Normal rank

Latest revision as of 13:51, 24 May 2024

scientific article
Language Label Description Also known as
English
Canonical DC programming problem: Outer approximation methods revisited
scientific article

    Statements

    Canonical DC programming problem: Outer approximation methods revisited (English)
    0 references
    0 references
    1 August 1996
    0 references
    0 references
    canonical DC programming
    0 references
    additional reverse convex constraint
    0 references
    outer approximation
    0 references
    cutting plane approaches
    0 references