Minimization of ratios
From MaRDI portal
Publication:1218786
Cites work
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 3480884 (Why is no real title available?)
- scientific article; zbMATH DE number 3495885 (Why is no real title available?)
- scientific article; zbMATH DE number 3284930 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- scientific article; zbMATH DE number 3354513 (Why is no real title available?)
- scientific article; zbMATH DE number 3417267 (Why is no real title available?)
- Maximal domains of quasi-convexity and pseudo-convexity for quadratic functions
- On the global minimum of a quasi-concave functional
- Quasi-concave minimization subject to linear constraints
- Quasi-Concave Programming
- Quasi-concavity and pseudo-concavity of cubic functions
- The Direct Power of Adjacent Vertex Programming Methods
Cited in
(11)- Fractional programming: Applications and algorithms
- A global optimization approach for solving the convex multiplicative programming problem
- Supervised dimensionality reduction via distance correlation maximization
- Optimising portfolio diversification and dimensionality
- Bibliography in fractional programming
- Efficient algorithms for solving nonlinear fractional programming problems
- Fractional programming
- Fractional programming
- Block sparse signal recovery via minimizing the block q-ratio sparsity
- On the convexification of nonlinear programming problems: An applications-oriented survey
- Convexification of nonsmooth monotone functions
This page was built for publication: Minimization of ratios
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1218786)
