On solving a class of fractional semi-infinite polynomial programming problems
From MaRDI portal
Publication:2231044
Cites work
- A complete characterization of the gap between convexity and sos-convexity
- A convex polynomial that is not sos-convex
- An algorithm for semi-infinite polynomial optimization
- An algorithm for the global optimization of a class of continuous minimax problems
- An SDP approach for quadratic fractional problems with a two-sided quadratic constraint
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Duality in semi-infinite programs and some works of Haar and Carathéodory
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- Fractional programming: The sum-of-ratios case
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- scientific article; zbMATH DE number 5982713 (Why is no real title available?)
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- Linear-fractional programming. Theory, methods, applications and software.
- Measure theory. Vol. I and II
- Multicriteria Optimization
- Nondifferentiable fractional semi-infinite multiobjective optimization problems
- NP-hardness of deciding convexity of quartic polynomials and related problems
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- On Extension of Fenchel Duality and its Application
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
- On solving a class of linear semi-infinite programming by SDP method
- On the complexity of Putinar's Positivstellensatz
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Polynomials that are positive on an interval
- Recent contributions to linear semi-infinite optimization
- Recent contributions to linear semi-infinite optimization: an update
- Semi-infinite fractional programming
- Semi-infinite programming
- Semi-infinite programming, duality, discretization and optimality conditions†
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semidefinite relaxations for semi-infinite polynomial programming
- Semidefinite representation of convex sets
- Semiinfinite multiobjective fractional programming. I: Sufficient efficiency conditions
- Semiinfinite multiobjective fractional programming. II: Duality models
- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data
- SOS approximations of nonnegative polynomials via simple high degree perturbations
- Strong duality in lasserre's hierarchy for polynomial optimization
- Strong duality in robust convex programming: complete characterizations
- Sums of squares on real algebraic curves
- Sums of squares, moment matrices and optimization over polynomials
- The K-moment problem for compact semi-algebraic sets
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Truncated \(K\)-moment problems in several variables
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(4)- A semi-infinite programming method for approximating load duration curves by polynomials
- An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials
- On Solving a Class of Fractional Semi-infinite Polynomial Programming Problems
- Approximate optimality conditions for approximate efficiency in semi-infinite multiobjective fractional programming problem
This page was built for publication: On solving a class of fractional semi-infinite polynomial programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2231044)
