Theory of linear and integer programming
Theory of linear and integer programming
Minimal representation of quadratically constrained convex feasible regions
Mathematical Programming: Series A and B
Interior point algorithms: theory and analysis
Interior point algorithms: theory and analysis
On parametric semidefinite programming
HPOPT '96 Proceedings of the Stieltjes workshop on High performance optimization techniques
A Frank–Wolfe Type Theorem for Convex Polynomial Programs
Computational Optimization and Applications
On Generalizations of the Frank-Wolfe Theorem to Convex and Quasi-Convex Programmes
Computational Optimization and Applications
| Hi-index | 0.00 |
In this paper we analyze properties of the analytic centers for perturbed convex problems. In particular we study the continuity of convex regions with respect to such characteristics as boundedness, full dimensionality and the existence of an analytic centre. Furthermore, we state the necessary and sufficient conditions for the existence of the analytic centre for possibly unbounded regions and we show that the analytic centre is identical for any minimal representation of the convex set. We are also concerned with the limiting behaviour of the central path as it approaches the set of optimal solutions of the problem.