A computational study of global optimization solvers on two trust region subproblems
type: Item
instance of: scholarly article
title: A computational study of global optimization solvers on two trust region subproblems
zbMATH Open document ID: 1405.90096
author: Tiago Montanher
author: Arnold Neumaier
author: Ferenc Domes
published in: Journal of Global Optimization
publication date: 2018-08-29T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6928832
zbMATH Keywords: reliability analysis
zbMATH Keywords: cluster effect
zbMATH Keywords: branch-and-bound solvers
zbMATH Keywords: SDP-relaxations
zbMATH Keywords: Celis-Dennis-Tapia subproblem
describes a project that uses: LINDOGlobal
describes a project that uses: GAMS
describes a project that uses: SCIP
describes a project that uses: Couenne
describes a project that uses: MINPACK-2
describes a project that uses: GloMIQO
describes a project that uses: Optimization Test Environment
describes a project that uses: BARON
describes a project that uses: LINDO
describes a project that uses: testenv
describes a project that uses: ANTIGONE
describes a project that uses: QPLIB
MaRDI profile type: Publication
full work available at URL: s10898-018-0649-7
OpenAlex ID: W2798031693
Wikidata QID: Q64949755
cites work: Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
cites work: \(\alpha BB\): A global optimization method for general constrained nonconvex problems
cites work: On Lagrangian relaxation of quadratic matrix constraints
cites work: Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem
cites work: New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
cites work: Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
cites work: Branching and bounds tighteningtechniques for non-convex MINLP
cites work: A note on polynomial solvability of the CDT problem
cites work: Global minimization using an augmented Lagrangian method with variable lower-level constraints
cites work: Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
cites work: Second-Order-Cone Constraints for Extended Trust-Region Subproblems
cites work: Q3681854
cites work: On Local Solutions of the Celis--Dennis--Tapia Subproblem
cites work: On maxima of dual function of the CDT subproblem
cites work: Trust Region Methods
cites work: The optimization test environment
cites work: Constraint aggregation for rigorous global optimization
cites work: The cluster problem in multivariate global optimization
cites work: A Global Convergence Theory for the Celis–Dennis–Tapia Trust-Region Algorithm for Constrained Optimization
cites work: Deterministic global optimization. Theory, methods and applications
cites work: On KKT points of Celis-Dennis-Tapia subproblem
cites work: First order rejection tests for multiple-objective optimization
cites work: Q5699646
cites work: The global solver in the LINDO API
cites work: Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
cites work: Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
cites work: GLOMIQO: global mixed-integer quadratic optimizer
cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
cites work: Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
cites work: Interval Methods for Systems of Equations
cites work: A comparison of complete global optimization solvers
cites work: CDT like approaches for the system of nonlinear equations
cites work: Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
cites work: Exclusion regions for optimization problems
cites work: Exclusion Regions for Systems of Equations
cites work: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
cites work: A two-variable approach to the two-trust-region subproblem
cites work: New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem
cites work: On a subproblem of trust region algorithms for constrained optimization
cites work: Recent advances in trust region algorithms
cites work: Celis-Dennis-Tapia based approach to quadratic fractional programming problems with two quadratic constraints
DOI: 10.1007/S10898-018-0649-7
Recommended article: On the global optimality of generalized trust region subproblems
Recommended article: A two-variable approach to the two-trust-region subproblem
Recommended article: Q4937626
Recommended article: On a subproblem of trust region algorithms for constrained optimization

A computational study of global optimization solvers on two trust region subproblems (Recommended article)
Recommended article: On globally solving the extended trust-region subproblems
Similarity Score: 0.89983606
Recommender Run: Recommender Run 3

A computational study of global optimization solvers on two trust region subproblems (Recommended article)
Recommended article: Globally Solving the Trust Region Subproblem Using Simple First-Order Methods
Similarity Score: 0.89964557
Recommender Run: Recommender Run 3

A computational study of global optimization solvers on two trust region subproblems (Recommended article)
Recommended article: An efficient algorithm for solving the generalized trust region subproblem
Similarity Score: 0.8973315
Recommender Run: Recommender Run 3

A computational study of global optimization solvers on two trust region subproblems (Recommended article)
Recommended article: On solving trust-region and other regularised subproblems in optimization
Similarity Score: 0.896651
Recommender Run: Recommender Run 3

A computational study of global optimization solvers on two trust region subproblems (Recommended article)
Recommended article: Trust region algorithm with two subproblems for bound constrained problems
Similarity Score: 0.8943158
Recommender Run: Recommender Run 3

A computational study of global optimization solvers on two trust region subproblems (Recommended article)
Recommended article: A hybrid algorithm for the two-trust-region subproblem
Similarity Score: 0.8937457
Recommender Run: Recommender Run 3