Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
From MaRDI portal
Publication:506441
DOI10.1007/S10898-016-0491-8zbMath1359.90107OpenAlexW2562420010MaRDI QIDQ506441
Yash Puranik, Nikolaos V. Sahinidis
Publication date: 1 February 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0491-8
Related Items (6)
Optimality-based domain reduction for inequality-constrained NLP and MINLP problems ⋮ Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization ⋮ (Global) optimization: historical notes and recent developments ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Tighter McCormick relaxations through subgradient propagation ⋮ Tuning BARON using derivative-free optimization algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex envelopes of products of convex and component-wise concave functions
- An LPCC approach to nonconvex quadratic programs
- Bound constrained interval global optimization in the COCONUT environment
- Relaxing the optimality conditions of box QP
- SCIP: solving constraint integer programs
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Handbook of test problems in local and global optimization
- A finite algorithm for global minimization of separable concave programs
- Convex extensions and envelopes of lower semi-continuous functions
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A polyhedral study of nonconvex quadratic programs with box constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Convex envelopes for edge-concave functions
- A polyhedral branch-and-cut approach to global optimization
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A branch-and-reduce approach to global optimization
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Global optimization of nonconvex problems with multilinear intermediates
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Convex underestimation strategies for signomial functions
- Branching and bounds tighteningtechniques for non-convex MINLP
- The global solver in the LINDO API
- Testing Unconstrained Optimization Software
- Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
- Transposition Theorems and Qualification‐Free Optimality Conditions
- Global optimization of general non-convex problems with intermediate bilinear substructures
- Global Optimization and Constraint Satisfaction
- Benchmarking optimization software with performance profiles.
- Constraint aggregation for rigorous global optimization
This page was built for publication: Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
