On solving a class of fractional semi-infinite polynomial programming problems
From MaRDI portal
Publication:2231044
DOI10.1007/s10589-021-00311-5OpenAlexW3196571586MaRDI QIDQ2231044
Publication date: 29 September 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.01256
polynomial optimizationsum-of-squaressemidefinite programming relaxationsfractional optimizationconvex semi-infinite systems
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Multi-objective and goal programming (90C29) Semi-infinite programming (90C34) Mathematical programming (90Cxx)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions and finite convergence of Lasserre's hierarchy
- A convex polynomial that is not sos-convex
- Semidefinite representation of convex sets
- Semi-infinite programming
- On the complexity of Putinar's Positivstellensatz
- SOS approximations of nonnegative polynomials via simple high degree perturbations
- An algorithm for the global optimization of a class of continuous minimax problems
- The \(K\)-moment problem for compact semi-algebraic sets
- Linear-fractional programming. Theory, methods, applications and software.
- Sums of squares on real algebraic curves
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
- Recent contributions to linear semi-infinite optimization
- Recent contributions to linear semi-infinite optimization: an update
- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data
- Nondifferentiable fractional semi-infinite multiobjective optimization problems
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- An algorithm for semi-infinite polynomial optimization
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- NP-hardness of deciding convexity of quartic polynomials and related problems
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
- Semi-infinite fractional programming
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Semidefinite relaxations for semi-infinite polynomial programming
- Global Optimization with Polynomials and the Problem of Moments
- Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
- An SDP approach for quadratic fractional problems with a two-sided quadratic constraint
- A Complete Characterization of the Gap between Convexity and SOS-Convexity
- Semiinfinite multiobjective fractional programming, Part I: Sufficient efficiency conditions
- Semiinfinite multiobjective fractional programming, part II: Duality models
- Fractional programming: The sum-of-ratios case
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Semi-Infinite Programming: Theory, Methods, and Applications
- On Extension of Fenchel Duality and its Application
- GloptiPoly 3: moments, optimization and semidefinite programming
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Semi-infinite programming, duality, discretization and optimality conditions†
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- Polynomials that are positive on an interval
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- On solving a class of linear semi-infinite programming by SDP method
- Multicriteria Optimization
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Strong duality in lasserre's hierarchy for polynomial optimization
