Solution of fractional quadratic programs on the simplex and application to the eigenvalue complementarity problem
From MaRDI portal
Publication:2139271
Recommendations
- An eaves type theorem for quadratic fractional programming problems and its applications
- An efficient algorithm for solving convex-convex quadratic fractional programs
- A novel approach for solving quadratic fractional programming problems
- On the solution of a nonconvex fractional quadratic problem
- Approximate solutions for continuous-time quadratic fractional programming problems
- scientific article; zbMATH DE number 592642
- On the complex fractional quadratic optimization with a quadratic constraint
- Fractional programming with convex quadratic forms and functions
- An Efficient algorithm for quadratic sum-of-ratios fractional programs problem
- scientific article; zbMATH DE number 939004
Cites work
- scientific article; zbMATH DE number 3557508 (Why is no real title available?)
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 939919 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem
- A nonsmooth algorithm for cone-constrained eigenvalue problems
- A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem
- An alternating direction method of multipliers for the eigenvalue complementarity problem
- Benchmarking optimization software with performance profiles.
- Complementary eigenvalues of graphs
- Copositivity and constrained fractional quadratic problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Fractional Programming
- Fractional Programming. II, On Dinkelbach's Algorithm
- Fractional programming: Applications and algorithms
- Global optimization for a class of fractional programming problems
- On Nonlinear Fractional Programming
- On the computation of all eigenvalues for the eigenvalue complementarity problem
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- Splitting methods for the eigenvalue complementarity problem
- Variational inequality formulation of the asymmetric eigenvalue complementarity problem and its solution by means of gap functions
Cited in
(3)
This page was built for publication: Solution of fractional quadratic programs on the simplex and application to the eigenvalue complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139271)