On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes

DOI10.1007/S10589-005-3063-2zbMath1111.90084OpenAlexW2148856424MaRDI QIDQ2506181

Wiesława T. Obuchowska

Publication date: 28 September 2006

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-005-3063-2

zbMATH Keywords

existence of optimal solutionscone of recessionconvex and quasi-convex constrained programs

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (12)

On the solution existence and stability of polynomial optimization problems ⋮ Unboundedness in reverse convex and concave integer programming ⋮ Γ‐robust linear complementarity problems with ellipsoidal uncertainty sets ⋮ Optimality Conditions for Minimizers at Infinity in Polynomial Programming ⋮ Global error bounds for piecewise convex polynomials ⋮ A Frank-Wolfe type theorem for nondegenerate polynomial programs ⋮ Irreducible infeasible sets in convex mixed-integer programs ⋮ Feasible partition problem in reverse convex and convex mixed-integer programming ⋮ Minimal infeasible constraint sets in convex integer programs ⋮ On boundedness of (quasi-)convex integer optimization problems ⋮ Conditions for boundedness in concave programming under reverse convex and convex constraints ⋮ Notes on the optimization problems corresponding to polynomial complementarity problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Remarks on the analytic centers of convex sets
• On \(\ell_ p\) programming
• Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints
• On extensions of the Frank-Wolfe theorems
• Convex constrained programmes with unattained infima
• How to deal with the unbounded in optimization: Theory and algorithms
• Error bounds in mathematical programming
• On the minimizing trajectory of convex functions with unbounded level sets
• A Frank--Wolfe type theorem for convex polynomial programs
• A generalization of the Frank—Wolfe theorem
• On Quadratic Programming
• Cone of recession and unboundedness of convex functions

This page was built for publication: On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes