scientific article; zbMATH DE number 6474937
From MaRDI portal
Publication:2941669
Recommendations
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- Approximating quadratic programming with bound and quadratic constraints
- Improved approximation bound for quadratic optimization problems with orthogonality constraints
- The optimality conditions for approximate solutions of quasiconvex programming problems
- On simultaneous approximation in quadratic integer programming
- Approximation algorithms for quadratic programming
- Quadratic Approximations in Convex Nondifferentiable Optimization
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
- Analysis of optimization algorithms via integral quadratic constraints: nonstrongly convex problems
- Branch-and-bound approaches to standard quadratic optimization problems
Cited in
(7)- Improved approximation results on standard quartic polynomial optimization
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
- Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
- Approximation Schemes for Multi-objective Optimization with Quadratic Constraints of Fixed CP-Rank
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- Efficient IBS from a new assumption in the multivariate-quadratic setting
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941669)
