DELIGHT.SPICE: an optimization-based system for the design of integrated circuits. - William Nye; David C. Riley; Alberto L. Sangiovanni-Vincentelli; André L. Tits (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1988)

Guardian maps and the generalized stability of parametrized families of matrices and polynomials. - Lahcen Saydy; André L. Tits; Eyad H. Abed (Math. Control. Signals Syst., 1990)

On combining feasibility, descent and superlinear convergence in inequality constrained optimization. - Eliane R. Panier; André L. Tits (Math. Program., 1993)

On continuity/discontinuity in robustness indicators. - Li Lee; André L. Tits (IEEE Trans. Autom. Control., 1993)

On the small-μ theorem. - André L. Tits; Michael K. H. Fan (Autom., 1995)

On the computation of the real Hurwitz-stability radius. - Li Qiu 001; André L. Tits; Yaguang Yang (IEEE Trans. Autom. Control., 1995)

An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions. - Jian L. Zhou 001; André L. Tits (SIAM J. Optim., 1996)

Globally convergent algorithms for robust pole assignment by state feedback. - André L. Tits; Yaguang Yang (IEEE Trans. Autom. Control., 1996)

Small-μ theorems with frequency-dependent uncertainty bounds. - André L. Tits; V. Balakrishnan 001 (Math. Control. Signals Syst., 1998)

Erratum: An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions. - Jian L. Zhou 001; André L. Tits (SIAM J. Optim., 1998)

Stability multipliers and μ upper bounds: connections and implications for numerical verification of frequency domain conditions. - Yung-Shan Chou; André L. Tits; V. Balakrishnan 001 (IEEE Trans. Autom. Control., 1999)

Robustness under bounded uncertainty with phase information. - André L. Tits; V. Balakrishnan 001; Li Lee (IEEE Trans. Autom. Control., 1999)

On Kharitonov's theorem without invariant degree assumption. - Amit A. Kale; André L. Tits (Autom., 2000)

A fast algorithm for the computation of an upper bound on the µ-norm. - Craig T. Lawrence; André L. Tits; Paul Van Dooren (Autom., 2000)

On mixed-µ synthesis. - André L. Tits; Yung-Shan Chou (Autom., 2000)

A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm. - Craig T. Lawrence; André L. Tits (SIAM J. Optim., 2001)

Comment on "The use of Routh array for testing the Hurwitz property of a segment of polynomials". - André L. Tits (Autom., 2002)

A Simple Primal-Dual Feasible Interior-Point Method for Nonlinear Programming with Monotone Descent. - Sasan Bakhtiari; André L. Tits (Comput. Optim. Appl., 2003)

A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties. - André L. Tits; Andreas Wächter; Sasan Bakhtiari; Thomas J. Urban; Craig T. Lawrence (SIAM J. Optim., 2003)

Constraint Reduction for Linear Programs with Many Inequality Constraints. - André L. Tits; Pierre-Antoine Absil; William P. Woessner (SIAM J. Optim., 2006)

Joint Scheduling and Routing for Ad-hoc Networks Under Channel State Uncertainty. - Anna Pantelidou; Anthony Ephremides; André L. Tits (WiOpt, 2007)

Newton-KKT interior-point methods for indefinite quadratic programming. - Pierre-Antoine Absil; André L. Tits (Comput. Optim. Appl., 2007)

Universal duality in conic convex optimization. - Simon P. Schurr; André L. Tits; Dianne P. O'Leary (Math. Program., 2007)

Convex Duality and Entropy-Based Moment Closures: Characterizing Degenerate Densities. - Cory D. Hauck; C. David Levermore; André L. Tits (SIAM J. Control. Optim., 2008)

A Polynomial-Time Interior-Point Method for Conic Optimization, With Inexact Barrier Evaluations. - Simon P. Schurr; Dianne P. O'Leary; André L. Tits (SIAM J. Optim., 2009)

A cross-layer approach for stable throughput maximization under channel state uncertainty. - Anna Pantelidou; Anthony Ephremides; André L. Tits (Wirel. Networks, 2009)

Feasible Sequential Quadratic Programming. - André L. Tits (Encyclopedia of Optimization, 2009)

Constraint-reduced interior-point optimization for model predictive rotorcraft control. - Meiyun Y. He; Mary Kiemb; André L. Tits; Aaron Greenfield; Vineet Sahasrabudhe (ACC, 2010)

Adaptive constraint reduction for convex quadratic programming. - Jin Hyuk Jung; Dianne P. O'Leary; André L. Tits (Comput. Optim. Appl., 2012)

A constraint-reduced variant of Mehrotra's predictor-corrector algorithm. - Luke B. Winternitz; Stacey O. Nicholls; André L. Tits; Dianne P. O'Leary (Comput. Optim. Appl., 2012)

Infeasible constraint-reduced interior-point methods for linear optimization. - Meiyun Y. He; André L. Tits (Optim. Methods Softw., 2012)

High-Order Entropy-Based Closures for Linear Transport in Slab Geometry II: A Computational Study of the Optimization Problem. - Graham W. Alldredge; Cory D. Hauck; André L. Tits (SIAM J. Sci. Comput., 2012)

Performance survey of robust pole placement methods. - Amit Pandey; Robert Schmid; Thang Nguyen-Tien; Yaguang Yang; Vasile Sima; André L. Tits (CDC, 2014)

Adaptive change of basis in entropy-based moment closures for linear kinetic equations. - Graham W. Alldredge; Cory D. Hauck; Dianne P. O'Leary; André L. Tits (J. Comput. Phys., 2014)

Addressing Rank Degeneracy in Constraint-Reduced Interior-Point Methods for Linear Optimization. - Luke B. Winternitz; André L. Tits; Pierre-Antoine Absil (J. Optim. Theory Appl., 2014)

Positive Filtered PN Moment Closures for Linear Kinetic Equations. - M. Paul Laiu; Cory D. Hauck; Ryan G. McClarren; Dianne P. O'Leary; André L. Tits (SIAM J. Numer. Anal., 2016)

A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme. - M. Paul Laiu; André L. Tits (Comput. Optim. Appl., 2019)

An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods. - M. Paul Laiu; André L. Tits (Math. Program., 2022)