The mixed integer trust region problem

DOI10.1007/S10107-024-02152-6MaRDI QIDQ6932181zbMATH OpenFDO

Authors Alberto Del Pia

Publication date 9 September 2025

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10107-024-02152-6

zbMATH Keywords

approximation algorithmellipsoid constraintmixed integer quadratic programmingpolynomial time algorithmtrust region problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Cites work

• A note on polynomial solvability of the CDT problem
• A PTAS for the minimization of polynomials of fixed degree over the simplex
• A trust region SQP algorithm for mixed-integer nonlinear programming
• A trust-region-based derivative free algorithm for mixed integer programming
• An approximation algorithm for indefinite mixed integer quadratic programming
• Approximation algorithms for quadratic programming
• Gadgets, Approximation, and Linear Programming
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3790207 (Why is no real title available?)
• scientific article; zbMATH DE number 2120513 (Why is no real title available?)
• scientific article; zbMATH DE number 4197756 (Why is no real title available?)
• Integer Programming
• Integer Programming with a Fixed Number of Variables
• Mixed-integer quadratic programming is in NP
• New Results on Quadratic Minimization
• On affine scaling algorithms for nonconvex quadratic programming
• On the complexity of quadratic programming with two quadratic constraints
• Polynomial Solvability of Variants of the Trust-Region Subproblem
• Polynomial time weak approximation algorithms for quadratic programming
• Quadratic programming with one negative eigenvalue is NP-hard
• Some simplified NP-complete graph problems
• The complexity of approximating a nonlinear program
• Trust Region Methods

This page was built for publication: The mixed integer trust region problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6932181)