Proportional-Integral Projected Gradient Method for Infeasibility Detection in Conic Optimization

A constrained optimization problem is primal infeasible if its constraints cannot be satisfied, and dual infeasible if the constraints of its dual problem cannot be satisfied. We propose a novel iterative method, named proportional-integral projected gradient method (PIPG), for detecting primal and dual infeasiblity in convex optimization with quadratic objective function and conic constraints. The iterates of PIPG either asymptotically provide a proof of primal or dual infeasibility, or asymptotically satisfy a set of primal-dual optimality conditions. Unlike existing methods, PIPG does not compute matrix inverse, which makes it better suited for large-scale and realtime applications. We demonstrate the application of PIPG in quasiconvex and mixed-integer optimization using examples in constrained optimal control.

[1]  Ming Yan,et al.  New convergence analysis of a primal-dual algorithm with large stepsizes , 2021, Adv. Comput. Math..

[2]  Stefano Di Cairano,et al.  Infeasibility detection in alternating direction method of multipliers for convex quadratic programs , 2014, 53rd IEEE Conference on Decision and Control.

[3]  John Lygeros,et al.  On the asymptotic behavior of the Douglas–Rachford and proximal-point algorithms for convex optimization , 2021, Optim. Lett..

[4]  Danylo Malyuta,et al.  Advances in Trajectory Optimization for Space Vehicle Control , 2021, Annu. Rev. Control..

[5]  Behccet Accikmecse,et al.  Proportional-Integral Projected Gradient Method for Model Predictive Control , 2020, IEEE Control Systems Letters.

[6]  Riccardo Bonalli,et al.  Convex Optimization for Trajectory Generation , 2021, ArXiv.

[7]  Stephen P. Boyd,et al.  Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding , 2013, Journal of Optimization Theory and Applications.

[8]  Stephen P. Boyd,et al.  Infeasibility Detection in the Alternating Direction Method of Multipliers for Convex Optimization , 2018, Journal of Optimization Theory and Applications.

[9]  Jing Wang,et al.  Control approach to distributed optimization , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[10]  Behçet Açıkmeşe,et al.  RLC Circuits-Based Distributed Mirror Descent Method , 2020, IEEE Control Systems Letters.

[11]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[12]  Stephen P. Boyd,et al.  Automatic repair of convex optimization problems , 2020, 2001.11010.

[13]  G. Nemhauser,et al.  Integer Programming , 2020 .

[14]  Behçet Açikmese,et al.  Mass-spring-damper networks for distributed optimization in non-Euclidean spaces , 2018, Autom..

[15]  Ning Sun,et al.  Minimum-Time Trajectory Planning for Underactuated Overhead Crane Systems With State and Control Constraints , 2014, IEEE Transactions on Industrial Electronics.

[16]  Ufuk Topcu,et al.  Proportional-Integral Projected Gradient Method for Conic Optimization , 2021, Autom..

[17]  Haihao Lu,et al.  Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming , 2021, SIAM J. Optim..

[18]  Wotao Yin,et al.  A new use of Douglas–Rachford splitting for identifying infeasible, unbounded, and pathological conic programs , 2019, Math. Program..

[19]  Goran Banjac.  On the minimal displacement vector of the Douglas-Rachford operator , 2021, Oper. Res. Lett..

[20]  J. Kuczy,et al.  Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start , 1992 .

[21]  Michael J. Todd,et al.  Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems , 1999, Math. Program..

[22]  Shinji Mizuno,et al.  An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm , 1994, Math. Oper. Res..

[23]  Heinz H. Bauschke,et al.  Convex Analysis and Monotone Operator Theory in Hilbert Spaces , 2011, CMS Books in Mathematics.

[24]  Yura Malitsky.  The primal-dual hybrid gradient method reduces to a primal method for linearly constrained optimization problems , 2017, 1706.02602.

[25]  Stephen P. Boyd,et al.  Disciplined quasiconvex programming , 2019, Optimization Letters.