Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
From MaRDI portal
Publication:506441
DOI10.1007/S10898-016-0491-8zbMATH Open1359.90107OpenAlexW2562420010MaRDI QIDQ506441FDOQ506441
Authors: 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
Recommendations
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
- Global optimality conditions for nonconvex minimization problems with quadratic constraints
- A deterministic approach to global box-constrained optimization
- Relaxing the optimality conditions of box QP
Cites Work
- The global solver in the LINDO API
- Testing Unconstrained Optimization Software
- SCIP: solving constraint integer programs
- Benchmarking optimization software with performance profiles.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex extensions and envelopes of lower semi-continuous functions
- A polyhedral branch-and-cut approach to global optimization
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- Title not available (Why is that?)
- Handbook of test problems in local and global optimization
- A polyhedral study of nonconvex quadratic programs with box constraints
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A branch-and-reduce approach to global optimization
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
- Convex underestimation strategies for signomial functions
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Convex envelopes for edge-concave functions
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
- Branching and bounds tighteningtechniques for non-convex MINLP
- Global optimization and constraint satisfaction: the branch-and-reduce approach
- Constraint aggregation for rigorous global optimization
- A finite algorithm for global minimization of separable concave programs
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- 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
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Global optimization of general non-convex problems with intermediate bilinear substructures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints
- Global optimization of nonconvex problems with multilinear intermediates
- Title not available (Why is that?)
- Relaxing the optimality conditions of box QP
- Transposition Theorems and Qualification‐Free Optimality Conditions
Cited In (8)
- Tighter McCormick relaxations through subgradient propagation
- Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization
- Tuning BARON using derivative-free optimization algorithms
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Solutions and optimality criteria to box constrained nonconvex minimization problems
- Domain reduction techniques for global NLP and MINLP optimization
- Relaxing the optimality conditions of box QP
- (Global) optimization: historical notes and recent developments
Uses Software
This page was built for publication: Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q506441)
