No label defined (Q4557933)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 6985433

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 6985433

Statements

scholarly article

0 references

Thai Doan Chuong

0 references

Vaithilingam Jeyakumar

0 references

publication date

27 November 2018

0 references

full work available at URL

http://www.heldermann.de/JCA/JCA25/JCA254/jca25073.htm#jca251

0 references

zbMATH Keywords

robust optimization

0 references

semi-infinite convex program

0 references

convex polynomial

0 references

semidefinite linear program

0 references

SDP relaxation

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

A Complete Characterization of the Gap between Convexity and SOS-Convexity

0 references

A Frank--Wolfe type theorem for convex polynomial programs

0 references

0 references

Robust Convex Optimization

0 references

Lectures on Modern Convex Optimization

0 references

Theory and Applications of Robust Optimization

0 references

Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions

0 references

A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals

0 references

Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints

0 references

Semidefinite representation of convex sets

0 references

0 references

0 references

Post-Optimal Analysis in Linear Semi-Infinite Optimization

0 references

Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications

0 references

Robust convex quadratically constrained programs

0 references

Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets

0 references

On polynomial optimization over non-compact semi-algebraic sets

0 references

Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems

0 references

Robust SOS-convex polynomial optimization problems: exact SDP relaxations

0 references

Dual semidefinite programs without duality gaps for a class of convex minimax programs

0 references

Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness

0 references

Zero duality gaps in infinite-dimensional programming

0 references

Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems

0 references

An algorithm for semi-infinite polynomial optimization

0 references

Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization

0 references

Quasi-Slater and Farkas--Minkowski Qualifications for Semi-infinite Programming with Applications

0 references

0 references

On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints

0 references

0 references

Convex Analysis

0 references

On general minimax theorems

0 references

Semidefinite relaxations for semi-infinite polynomial programming

0 references

On solving a class of linear semi-infinite programming by SDP method

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4557933

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4557933&oldid=36452078"