Copositivity and constrained fractional quadratic problems
From MaRDI portal
Publication:403649
DOI10.1007/S10107-013-0690-8zbMath1312.90049OpenAlexW2095393540WikidataQ59140345 ScholiaQ59140345MaRDI QIDQ403649
Joaquim Joao Júdice, Immanuel M. Bomze, Paula Amaral
Publication date: 29 August 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-013-0690-8
fractional programmingcompletely positive optimization formulationcopositivity optimization formulationfractional quadratic problem
Semidefinite programming (90C22) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Fractional programming (90C32) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (18)
Solving multi-objective integer indefinite quadratic fractional programs ⋮ Solution of fractional quadratic programs on the simplex and application to the eigenvalue complementarity problem ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ A computational study for bilevel quadratic programs using semidefinite relaxations ⋮ An exact semidefinite programming approach for the max-mean dispersion problem ⋮ Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications ⋮ (Global) optimization: historical notes and recent developments ⋮ Copositive optimization -- recent developments and applications ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Solutions of the combinatorial problem with a quadratic fractional objective function on the set of permutations ⋮ A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem ⋮ Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations ⋮ Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations ⋮ Building a completely positive factorization ⋮ Discriminant analysis of distributional data via fractional programming ⋮ Optimality conditions for linear copositive programming problems with isolated immobile indices ⋮ Two-stage stochastic standard quadratic optimization ⋮ Completely positive reformulations for polynomial optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Copositive optimization -- recent developments and applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- On the computational complexity of membership problems for the completely positive cone and its dual
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- An efficient algorithm for solving convex-convex quadratic fractional programs
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
- Semidefinite programming relaxations for semialgebraic problems
- The directional instability problem in systems with frictional contacts.
- Connections between the total least squares and the correction of an infeasible system of linear inequalities
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
- Algorithmic copositivity detection by simplicial partition
- Global optimization of rational functions: a semidefinite programming approach
- Regularized total least squares based on quadratic eigenvalue problem solvers
- D.C. versus copositive bounds for standard QP
- Computable representations for convex hulls of low-dimensional quadratic forms
- Global Optimization with Polynomials and the Problem of Moments
- Copositive Programming
- On the accuracy of uniform polyhedral approximations of the copositive cone
- On the asymmetric eigenvalue complementarity problem
- GloptiPoly 3: moments, optimization and semidefinite programming
- Finding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares
- The Operator $\Psi$ for the Chromatic Number of a Graph
- Some NP-complete problems in quadratic and nonlinear programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Efficient Algorithms for Solution of Regularized Total Least Squares
- Tikhonov Regularization and Total Least Squares
- The symmetric eigenvalue complementarity problem
- Semidefinite Programming
- Copositivity and the Minimization of Quadratic Functions with Nonnegativity and Quadratic Equality Constraints
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- On copositive programming and standard quadratic optimization problems
- Maximization of the ratio of two convex quadratic functions over a polytope
This page was built for publication: Copositivity and constrained fractional quadratic problems
