Copositivity and constrained fractional quadratic problems
DOI10.1007/S10107-013-0690-8zbMATH Open1312.90049OpenAlexW2095393540WikidataQ59140345 ScholiaQ59140345MaRDI QIDQ403649FDOQ403649
Joaquim J. 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
Convex programming (90C25) Fractional programming (90C32) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Semidefinite programming (90C22) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Semidefinite Programming
- Some NP-complete problems in quadratic and nonlinear programming
- Global optimization with polynomials and the problem of moments
- Semidefinite programming relaxations for semialgebraic problems
- The directional instability problem in systems with frictional contacts.
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Global optimization of rational functions: a semidefinite programming approach
- On the asymmetric eigenvalue complementarity problem
- GloptiPoly 3: moments, optimization and semidefinite programming
- The symmetric eigenvalue complementarity problem
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- The Operator $\Psi$ for the Chromatic Number of a Graph
- On the computational complexity of membership problems for the completely positive cone and its dual
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Copositive optimization -- recent developments and applications
- Algorithmic copositivity detection by simplicial partition
- Computable representations for convex hulls of low-dimensional quadratic forms
- Copositive Programming
- On the accuracy of uniform polyhedral approximations of the copositive cone
- On copositive programming and standard quadratic optimization problems
- Maximization of the ratio of two convex quadratic functions over a polytope
- An efficient algorithm for solving convex-convex quadratic fractional programs
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- Copositivity and the Minimization of Quadratic Functions with Nonnegativity and Quadratic Equality Constraints
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
- Connections between the total least squares and the correction of an infeasible system of linear inequalities
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
- Regularized total least squares based on quadratic eigenvalue problem solvers
- D.C. versus copositive bounds for standard QP
- Finding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares
- Efficient Algorithms for Solution of Regularized Total Least Squares
- Tikhonov Regularization and Total Least Squares
Cited In (18)
- Two-stage stochastic standard quadratic optimization
- Optimality conditions for linear copositive programming problems with isolated immobile indices
- An exact semidefinite programming approach for the max-mean dispersion problem
- Solving multi-objective integer indefinite quadratic fractional programs
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Copositive optimization -- recent developments and applications
- Solution of fractional quadratic programs on the simplex and application to the eigenvalue complementarity problem
- Discriminant analysis of distributional data via fractional programming
- Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations
- 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
- Building a completely positive factorization
- Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications
- Solutions of the combinatorial problem with a quadratic fractional objective function on the set of permutations
- Completely positive reformulations for polynomial optimization
- (Global) optimization: historical notes and recent developments
- A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem
Uses Software
Recommendations
- Fractional programming with convex quadratic forms and functions π π
- Solving sum of quadratic ratios fractional programs via monotonic function π π
- An efficient algorithm for solving convex-convex quadratic fractional programs π π
- Copositivity and the Minimization of Quadratic Functions with Nonnegativity and Quadratic Equality Constraints π π
- A duality theory for a class of generalized fractional programs π π
- Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations π π
- On solving the quadratic sum-of-ratios problems π π
- A method for fractional programming π π
- On the quadratic fractional optimization with a strictly convex quadratic constraint π π
- Maximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programming π π
This page was built for publication: Copositivity and constrained fractional quadratic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403649)