Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(10 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-016-0491-8 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: GAMS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LINDOGlobal / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SCIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BARON / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ANTIGONE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LINDO / rank
 
Normal rank
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.1007/s10898-016-0491-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2562420010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of nonconvex problems with multilinear intermediates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching and bounds tighteningtechniques for non-convex MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxing the optimality conditions of box QP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally solving nonconvex quadratic programming problems via completely positive programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint aggregation for rigorous global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of test problems in local and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4697332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LPCC approach to nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex envelopes of products of convex and component-wise concave functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex envelopes generated from finitely many compact convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5806966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The global solver in the LINDO API / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex underestimation strategies for signomial functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bound constrained interval global optimization in the COCONUT environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex envelopes for edge-concave functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3928137 / 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: Global Optimization and Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transposition Theorems and Qualification‐Free Optimality Conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite algorithm for global minimization of separable concave programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit convex and concave envelopes through polyhedral subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex extensions and envelopes of lower semi-continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral branch-and-cut approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study of nonconvex quadratic programs with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of general non-convex problems with intermediate bilinear substructures / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-016-0491-8 / rank
 
Normal rank

Latest revision as of 19:46, 9 December 2024

scientific article
Language Label Description Also known as
English
Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
scientific article

    Statements

    Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (English)
    0 references
    0 references
    0 references
    1 February 2017
    0 references
    global optimization
    0 references
    bounds tightening
    0 references
    optimality conditions
    0 references
    box-constrained optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers