Set intersection theorems and existence of optimal solutions

DOI10.1007/S10107-006-0003-6zbMATH Open1133.90009OpenAlexW2021872351MaRDI QIDQ879966FDOQ879966

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

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

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)

Cites Work

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

Cited In (13)

• Optimality Conditions for Minimizers at Infinity in Polynomial Programming
• Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs
• Berge's maximum theorem for noncompact image sets
• Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
• Bad Semidefinite Programs: They All Look the Same
• On conic QPCCs, conic QCQPs and completely positive programs
• Optimal Inclusion of a Solution Set
• Strong duality and minimal representations for cone optimization
• On stability of solutions to parametric generalized affine variational inequalities
• Title not available (Why is that?)
• On the solution existence of nonconvex quadratic programming problems in Hilbert spaces
• On the complexity of testing attainment of the optimal value in nonlinear optimization
• Families of abstract decision problems whose admissible sets intersect in a singleton

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)