A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
From MaRDI portal
Publication:1780950
DOI10.1007/S10107-005-0582-7zbMATH Open1099.90039OpenAlexW2075161899MaRDI QIDQ1780950FDOQ1780950
Authors: Jeff Linderoth 
Publication date: 14 June 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0582-7
Recommendations
- A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
- A branch and bound algorithm for nonconvex quadratic programming with quadratic constraints
- scientific article; zbMATH DE number 7366738
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- scientific article; zbMATH DE number 970354
Cites Work
- BARON: A general purpose global optimization software package
- Title not available (Why is that?)
- Rigorous global search: continuous problems
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Benchmarking optimization software with performance profiles.
- On Polyhedral Approximations of the Second-Order Cone
- Semidefinite relaxations of fractional programs via novel convexification techniques
- A new reformulation-linearization technique for bilinear programming problems
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A branch-and-reduce approach to global optimization
- An algorithm for nonconvex programming problems
- A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
- A relaxation method for nonconvex quadratically constrained quadratic programs
- An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
- Title not available (Why is that?)
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- The convergence rate of the sandwich algorithm for approximating convex functions
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- Rigorous Lower and Upper Bounds in Linear Programming
Cited In (92)
- An accelerating algorithm for globally solving nonconvex quadratic programming
- Electricity swing option pricing by stochastic bilevel optimization: a survey and new approaches
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
- Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- Convex and concave envelopes: revisited and new perspectives
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- Alternative branching rules for some nonconvex problems
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
- Scalable Optimization Methods for Incorporating Spatiotemporal Fractionation into Intensity-Modulated Radiotherapy Planning
- Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems
- Title not available (Why is that?)
- Quadratic optimization with switching variables: the convex hull for \(n=2\)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- Global solutions to a class of CEC benchmark constrained optimization problems
- On conic QPCCs, conic QCQPs and completely positive programs
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
- Convex envelopes of bivariate functions through the solution of KKT systems
- A review of recent advances in global optimization
- An optimal trade-off model for portfolio selection with sensitivity of parameters
- Branch-and-bound approaches to standard quadratic optimization problems
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
- On structural decompositions of finite frames
- Active allocation of systematic risk and control of risk sensitivity in portfolio optimization
- The exact solution of multiparametric quadratically constrained quadratic programming problems
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- A fair division approach to humanitarian logistics inspired by conditional value-at-risk
- A parametric linearizing approach for quadratically inequality constrained quadratic programs
- Template polyhedra and bilinear optimization
- Explicit convex and concave envelopes through polyhedral subdivisions
- Non polyhedral convex envelopes for 1-convex functions
- A new branch-and-bound algorithm for standard quadratic programming problems
- A new algorithm for concave quadratic programming
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- Copositivity and constrained fractional quadratic problems
- A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A linearized relaxing algorithm for the specific nonlinear optimization problem
- A novel optimization method for nonconvex quadratically constrained quadratic programs
- Generating cutting planes for the semidefinite relaxation of quadratic programs
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
- A branch and bound reduced algorithm for quadratic programming problems with quadratic constraints
- An extension of Yuan's lemma and its applications in optimization
- Continuous piecewise linear delta-approximations for bivariate and multivariate functions
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
- A relaxation method for nonconvex quadratically constrained quadratic programs
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Error bounds for monomial convexification in polynomial optimization
- On convex relaxations for quadratically constrained quadratic programming
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- A branch and bound algorithm for nonconvex quadratic programming with quadratic constraints
- New multi-commodity flow formulations for the pooling problem
- Optimal portfolio deleveraging under market impact and margin restrictions
- A technique to derive the analytical form of convex envelopes for some bivariate functions
- An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints.
- Global optimization algorithm for mixed integer quadratically constrained quadratic program
- A class of differential quadratic programming problems
- Computable representations for convex hulls of low-dimensional quadratic forms
- Convex envelopes for ray-concave functions
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
- Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program
- A distributed continuous-time method for non-convex QCQPs
- Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints
- The convex hull of a quadratic constraint over a polytope
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
- Active fault diagnosis under hybrid bounded and Gaussian uncertainties
- A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints
- Using general triangle inequalities within quadratic convex reformulation method
- Effective algorithms for optimal portfolio deleveraging problem with cross impact
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
- A new global algorithm for factor-risk-constrained mean-variance portfolio selection
- A branch-bound cut technique for non-linear fractional multi-objective optimization problems
- Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
- Convex hull representations for bounded products of variables
- New SOCP relaxation and branching rule for bipartite bilinear programs
- Tight convex relaxations for the expansion planning problem
- A geometric branch and bound method for robust maximization of convex functions
- Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
- Using two-dimensional projections for stronger separation and propagation of bilinear terms
- (Global) optimization: historical notes and recent developments
- A simultaneous diagonalization based SOCP relaxation for portfolio optimization with an orthogonality constraint
- A quadratic lower bound for homogeneous algebraic branching programs
Uses Software
This page was built for publication: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1780950)
