Convex and concave relaxations of implicit functions (Q2943829): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/10556788.2014.924514 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2140637471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigorous convex underestimators for general twice-differentiable problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduced space branch and bound algorithm for global optimization. / 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: SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interval Newton method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4445267 / 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: Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint decomposition algorithms in global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioners for the Interval Gauss–Seidel Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 811: NDA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: McCormick-Based Relaxations of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel algorithm for constrained concave quadratic global minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4115333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-reduce approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized McCormick relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral branch-and-cut approach to global optimization / rank
 
Normal rank

Latest revision as of 18:12, 10 July 2024

scientific article
Language Label Description Also known as
English
Convex and concave relaxations of implicit functions
scientific article

    Statements

    Convex and concave relaxations of implicit functions (English)
    0 references
    0 references
    0 references
    0 references
    4 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    global optimization
    0 references
    McCormick relaxations
    0 references
    nonconvex programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references