A new simplicial cover technique in constrained global optimization (Q1187367): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separable concave minimization via partial outer approximation and branch and bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using convex envelopes to solve the interactive fixed-charge linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound-outer approximation algorithm for concave minimization over a convex set / 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: An Algorithm for Separable Nonconvex Programming Problems / 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: An algorithm for nonconvex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the convergence of an algorithm for nonconvex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concave minimization via conical partitions and polyhedral outer approximation / 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: On geometry and convergence of a class of simplicial covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outer approximation by polyhedral convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an outer approximation concept in global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of global methods in multiextremal optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained global optimization: algorithms and applications / 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: Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms / 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: A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set / rank
 
Normal rank

Latest revision as of 17:32, 15 May 2024

scientific article
Language Label Description Also known as
English
A new simplicial cover technique in constrained global optimization
scientific article

    Statements

    A new simplicial cover technique in constrained global optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 August 1992
    0 references
    0 references
    constrained global optimization
    0 references
    simplicial branch and bound-outer approximation technique
    0 references
    nonseparable, nonlinearly constrained concave minimization
    0 references
    0 references