Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization

V. Jeyakumar University of New South Wales Guoyin Li University of New South Wales

Numerical Analysis and Scientific Computing Numerical Linear Algebra Optimization and Control mathscidoc:2108.25002

Mathematical Programming, 147, 171-206, 2014.6
The trust-region problem,which minimizes a nonconvex quadratic function over a ball, is a key subproblem in trust-region methods for solving nonlinear optimization problems. It enjoys many attractive properties such as an exact semi-definite linear programming relaxation (SDP-relaxation) and strong duality. Unfortunately, such properties do not, in general, hold for an extended trust-region problem having extra linear constraints. This paper shows that two useful and powerful features of the classical trust-region problem continue to hold for an extended trust-region problem with linear inequality constraints under a new dimension condition. First, we establish that the class of extended trust-region problems has an exact SDP-relaxation, which holds without the Slater constraint qualification. This is achieved by proving that a system of quadratic and affine functions involved in the model satisfies a range-convexity whenever the dimension condition is fulfilled. Second, we show that the dimension condition together with the Slater condition ensures that a set of combined first and second-order Lagrange multiplier conditions is necessary and sufficient for global optimality of the extended trust-region problem and consequently for strong duality. Through simple examples we also provide an insightful account of our development from SDP-relaxation to strong duality. Finally, we show that the dimension condition is easily satisfied for the extended trust-region model that arises from the reformulation of a robust least squares problem (LSP) as well as a robust second order cone programming model problem (SOCP) as an equivalent semi-definite linear programming problem. This leads us to conclude that, under mild assumptions, solving a robust LSP or SOCP under matrix-norm uncertainty or polyhedral uncertainty is equivalent to solving a semi-definite linear programming problem and so, their solutions can be validated in polynomial time.
Trust-region problems with linear inequality constraints, Semi-definite program relaxation, global optimization, robust optimization
[ Download ] [ 2021-08-23 15:28:15 uploaded by gyli ] [ 133 downloads ] [ 0 comments ]
@inproceedings{v.2014trust-region,
  title={Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization},
  author={V. Jeyakumar, and Guoyin Li},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20210823152815315595861},
  booktitle={Mathematical Programming},
  volume={147},
  pages={171-206},
  year={2014},
}
V. Jeyakumar, and Guoyin Li. Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization. 2014. Vol. 147. In Mathematical Programming. pp.171-206. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20210823152815315595861.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved