A computational study of global optimization solvers on two trust region subproblems
From MaRDI portal
Publication:1668805
DOI10.1007/s10898-018-0649-7zbMath1405.90096OpenAlexW2798031693WikidataQ64949755 ScholiaQ64949755MaRDI QIDQ1668805
Ferenc Domes, Tiago Montanher, Arnold Neumaier
Publication date: 29 August 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0649-7
reliability analysiscluster effectbranch-and-bound solversCelis-Dennis-Tapia subproblemSDP-relaxations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
Finding second-order stationary points in constrained minimization: a feasible direction approach, Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem, A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- GLOMIQO: global mixed-integer quadratic optimizer
- Celis-Dennis-Tapia based approach to quadratic fractional programming problems with two quadratic constraints
- On KKT points of Celis-Dennis-Tapia subproblem
- On a subproblem of trust region algorithms for constrained optimization
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- The cluster problem in multivariate global optimization
- A comparison of complete global optimization solvers
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Deterministic global optimization. Theory, methods and applications
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Exclusion regions for optimization problems
- First order rejection tests for multiple-objective optimization
- Recent advances in trust region algorithms
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- The optimization test environment
- CDT like approaches for the system of nonlinear equations
- On Lagrangian Relaxation of Quadratic Matrix Constraints
- A Note on Polynomial Solvability of the CDT Problem
- A Two-Variable Approach to the Two-Trust-Region Subproblem
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem
- Branching and bounds tighteningtechniques for non-convex MINLP
- The global solver in the LINDO API
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Interval Methods for Systems of Equations
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- Trust Region Methods
- On Local Solutions of the Celis--Dennis--Tapia Subproblem
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Exclusion Regions for Systems of Equations
- A Global Convergence Theory for the Celis–Dennis–Tapia Trust-Region Algorithm for Constrained Optimization
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- Constraint aggregation for rigorous global optimization
