Set intersection theorems and existence of optimal solutions

DOI10.1007/S10107-006-0003-6MaRDI QIDQ879966zbMATH OpenOpenAlexFDO

Authors Dimitri P. Bertsekas, Paul Tseng

Publication date 10 May 2007

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-006-0003-6

zbMATH Keywords

global minimumquasiconvex functionset intersectionasymptotic directionFrank-Wolfe theoremrecession direction

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Minimax problems in mathematical programming (90C47)

Recommendations

• On extensions of the Frank-Wolfe theorems
• scientific article; zbMATH DE number 18667
• scientific article; zbMATH DE number 4082259
• Intersection theorems concerning noncompact sets with H-convex sections and their applications
• Publication:4863991

Cites work

• scientific article; zbMATH DE number 3672021 (Why is no real title available?)
• scientific article; zbMATH DE number 3674740 (Why is no real title available?)
• scientific article; zbMATH DE number 3791104 (Why is no real title available?)
• scientific article; zbMATH DE number 193113 (Why is no real title available?)
• scientific article; zbMATH DE number 3580262 (Why is no real title available?)
• scientific article; zbMATH DE number 557207 (Why is no real title available?)
• scientific article; zbMATH DE number 3799413 (Why is no real title available?)
• scientific article; zbMATH DE number 1821400 (Why is no real title available?)
• scientific article; zbMATH DE number 3084780 (Why is no real title available?)
• A Frank--Wolfe type theorem for convex polynomial programs
• A generalization of the Frank—Wolfe theorem
• Convex Analysis
• Existence of global minima for constrained optimization
• Existence of optimal solutions and duality results under weak conditions
• How to deal with the unbounded in optimization: Theory and algorithms
• Noncoercive Optimization Problems
• On Quadratic Programming
• On \(\ell_ p\) programming
• On extensions of the Frank-Wolfe theorems
• Ordinary convex programs without a duality gap
• Stability of mixed-integer quadratic programming problems
• Technical Note—Direct Proof of the Existence Theorem for Quadratic Programming
• Variational Analysis
• Über die existenz von lösungen ganzzahliger optimierungsaufgaben

Cited in

(13)

• Berge's maximum theorem for noncompact image sets
• Bad semidefinite programs: they all look the same
• Characterizing bad semidefinite programs: normal forms and short proofs
• On the solution existence of nonconvex quadratic programming problems in Hilbert spaces
• On stability of solutions to parametric generalized affine variational inequalities
• Families of abstract decision problems whose admissible sets intersect in a singleton
• On the complexity of testing attainment of the optimal value in nonlinear optimization
• Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
• Optimality conditions for minimizers at infinity in polynomial programming
• scientific article; zbMATH DE number 7238236 (Why is no real title available?)
• Optimal Inclusion of a Solution Set
• On conic QPCCs, conic QCQPs and completely positive programs
• Strong duality and minimal representations for cone optimization

This page was built for publication: Set intersection theorems and existence of optimal solutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879966)