Set intersection theorems and existence of optimal solutions

DOI10.1007/S10107-006-0003-6zbMath1133.90009OpenAlexW2021872351MaRDI QIDQ879966

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

quasiconvex functionglobal minimumset intersectionasymptotic directionFrank-Wolfe theoremrecession direction

Mathematics Subject Classification ID

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

Related Items (10)

On conic QPCCs, conic QCQPs and completely positive programs ⋮ Strong duality and minimal representations for cone optimization ⋮ Optimality Conditions for Minimizers at Infinity in Polynomial Programming ⋮ On the solution existence of nonconvex quadratic programming problems in Hilbert spaces ⋮ Bad Semidefinite Programs: They All Look the Same ⋮ Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming ⋮ On the complexity of testing attainment of the optimal value in nonlinear optimization ⋮ On stability of solutions to parametric generalized affine variational inequalities ⋮ Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs ⋮ Berge's maximum theorem for noncompact image sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Existence of global minima for constrained optimization
• On \(\ell_ p\) programming
• On extensions of the Frank-Wolfe theorems
• How to deal with the unbounded in optimization: Theory and algorithms
• Existence of optimal solutions and duality results under weak conditions
• A Frank--Wolfe type theorem for convex polynomial programs
• Ordinary convex programs without a duality gap
• Stability of mixed-integer quadratic programming problems
• A generalization of the Frank—Wolfe theorem
• Über die existenz von lösungen ganzzahliger optimierungsaufgaben
• Noncoercive Optimization Problems
• Variational Analysis
• Convex Analysis
• Technical Note—Direct Proof of the Existence Theorem for Quadratic Programming
• On Quadratic Programming

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