Linear fractional optimization problems on Jordan Euclidean algebras
From MaRDI portal
Cites work
- A duality theorem for non-linear programming
- A simple characterization of solutions sets of convex programs
- Fractional programming - a survey
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 7450966 (Why is no real title available?)
- scientific article; zbMATH DE number 7416606 (Why is no real title available?)
- scientific article; zbMATH DE number 3407452 (Why is no real title available?)
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- On semidefinite linear fractional optimization problems
- Programming with linear fractional functionals
- The dual of a fractional linear program
Cited in
(1)
This page was built for publication: Linear fractional optimization problems on Jordan Euclidean algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088834)