A branch and bound algorithm for quantified quadratic programming
From MaRDI portal
Publication:2397427
DOI10.1007/S10898-016-0462-0zbMATH Open1371.90096OpenAlexW2507928326MaRDI QIDQ2397427FDOQ2397427
Authors: Ferenc Domes, Alexandre Goldsztejn 
Publication date: 22 May 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0462-0
Recommendations
- scientific article; zbMATH DE number 7366738
- scientific article; zbMATH DE number 970354
- Global optimization of quadratic programming problems with quadratic constraints
- A branch and bound reduced algorithm for quadratic programming problems with quadratic constraints
- A global optimization approach for quadratic programs with nonconvex quadratic constraints
Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15)
Cites Work
- PROFIL/BIAS - A fast interval library
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Robust optimization
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Infinitely constrained optimization problems
- Robust solutions of uncertain linear programs
- Robust solutions of linear programming problems contaminated with uncertain data
- Interval Methods for Systems of Equations
- Title not available (Why is that?)
- Robust Solutions to Uncertain Semidefinite Programs
- Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty
- Title not available (Why is that?)
- Title not available (Why is that?)
- Subdivision Direction Selection in Interval Methods for Global Optimization
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- On proving existence of feasible points in equality constrained optimization problems
- Rigorous verification of feasibility
- Title not available (Why is that?)
- Constraint propagation on quadratic constraints
- The cluster problem in multivariate global optimization
- Exclusion Regions for Systems of Equations
- Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning
- A rigorous global filtering algorithm for quadratic constraints
- On tractable approximations of uncertain linear matrix inequalities affected by interval uncertainty
- Interval computations, rigour and non-rigour in deterministic continuous global optimization
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
- First order rejection tests for multiple-objective optimization
Cited In (9)
- Algorithms for bound constrained quadratic programming problems
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- Title not available (Why is that?)
- A branch and bound reduced algorithm for quadratic programming problems with quadratic constraints
- An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints.
- Quadratic lower bounds for algebraic branching programs and formulas
- An accelerating branch-and-bound algorithm for the sum of quadratic ratios problem
- A quadratic lower bound for homogeneous algebraic branching programs
- Title not available (Why is that?)
Uses Software
This page was built for publication: A branch and bound algorithm for quantified quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397427)
