Conic linear programming duals for classes of quadratic semi-infinite programs with applications
type: Item
instance of: scholarly article
title: Conic linear programming duals for classes of quadratic semi-infinite programs with applications
zbMATH Open document ID: 1495.90220
author: Cao Thanh Tinh
author: Thai Doan Chuong
published in: Journal of Optimization Theory and Applications
publication date: 2022-07-18T00:00:00Z
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 7558553
zbMATH Keywords: semi-infinite programming
zbMATH Keywords: duality
zbMATH Keywords: conic linear programming
zbMATH Keywords: fractional programming
zbMATH Keywords: quadratic functions
MaRDI profile type: MaRDI publication profile
full work available at URL: s10957-022-02040-z
OpenAlex ID: W4280532596
cites work: Q3182207
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Theory and Applications of Robust Optimization
cites work: Semidefinite Optimization and Convex Algebraic Geometry
cites work: Q5480077
cites work: Semidefinite program duals for separable polynomial programs involving box constraints
cites work: Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs
cites work: Exact relaxations for parametric robust linear optimization problems
cites work: Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
cites work: A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
cites work: Convergent conic linear programming relaxations for cone convex polynomial programs
cites work: A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
cites work: Robust linear semi-infinite programming duality under uncertainty
cites work: Q4357206
cites work: Post-Optimal Analysis in Linear Semi-Infinite Optimization
cites work: Recent contributions to linear semi-infinite optimization: an update
cites work: Robust convex quadratically constrained programs
cites work: Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
cites work: Robust SOS-convex polynomial optimization problems: exact SDP relaxations
cites work: Strong Duality in Robust Convex Programming: Complete Characterizations
cites work: Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems
cites work: Dual semidefinite programs without duality gaps for a class of convex minimax programs
cites work: Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems
cites work: Applications of second-order cone programming
cites work: Semi-infinite programming
cites work: Nonsmooth analysis
cites work: How to solve a semi-infinite optimization problem
cites work: Semidefinite relaxations for semi-infinite polynomial programming
cites work: On solving a class of linear semi-infinite programming by SDP method
cites work: Q3149262
DOI: 10.1007/S10957-022-02040-Z
description: scientific article; zbMATH DE number 7558553