default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndré L. Tits
Person information
- affiliation: University of Maryland, College Park, MD, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j34]M. Paul Laiu
, André L. Tits:
An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods. Math. Program. 195(1): 327-366 (2022)
2010 – 2019
- 2019
- [j33]M. Paul Laiu, André L. Tits:
A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme. Comput. Optim. Appl. 72(3): 727-768 (2019) - 2016
- [j32]M. Paul Laiu, Cory D. Hauck, Ryan G. McClarren, Dianne P. O'Leary, André L. Tits:
Positive Filtered PN Moment Closures for Linear Kinetic Equations. SIAM J. Numer. Anal. 54(6): 3214-3238 (2016) - 2014
- [j31]Graham W. Alldredge, Cory D. Hauck, Dianne P. O'Leary, André L. Tits:
Adaptive change of basis in entropy-based moment closures for linear kinetic equations. J. Comput. Phys. 258: 489-508 (2014) - [j30]Luke B. Winternitz, André L. Tits, Pierre-Antoine Absil:
Addressing Rank Degeneracy in Constraint-Reduced Interior-Point Methods for Linear Optimization. J. Optim. Theory Appl. 160(1): 127-157 (2014) - [c4]Amit Pandey, Robert Schmid, Thang Nguyen-Tien, Yaguang Yang, Vasile Sima, André L. Tits:
Performance survey of robust pole placement methods. CDC 2014: 3186-3191 - 2012
- [j29]Jin Hyuk Jung, Dianne P. O'Leary, André L. Tits:
Adaptive constraint reduction for convex quadratic programming. Comput. Optim. Appl. 51(1): 125-157 (2012) - [j28]Luke B. Winternitz, Stacey O. Nicholls, André L. Tits, Dianne P. O'Leary:
A constraint-reduced variant of Mehrotra's predictor-corrector algorithm. Comput. Optim. Appl. 51(3): 1001-1036 (2012) - [j27]Meiyun Y. He, André L. Tits:
Infeasible constraint-reduced interior-point methods for linear optimization. Optim. Methods Softw. 27(4-5): 801-825 (2012) - [j26]Graham W. Alldredge, Cory D. Hauck, André L. Tits:
High-Order Entropy-Based Closures for Linear Transport in Slab Geometry II: A Computational Study of the Optimization Problem. SIAM J. Sci. Comput. 34(4) (2012) - 2010
- [c3]Meiyun Y. He, Mary Kiemb, André L. Tits, Aaron Greenfield, Vineet Sahasrabudhe:
Constraint-reduced interior-point optimization for model predictive rotorcraft control. ACC 2010: 2088-2094
2000 – 2009
- 2009
- [j25]Simon P. Schurr, Dianne P. O'Leary, André L. Tits:
A Polynomial-Time Interior-Point Method for Conic Optimization, With Inexact Barrier Evaluations. SIAM J. Optim. 20(1): 548-571 (2009) - [j24]Anna Pantelidou, Anthony Ephremides, André L. Tits:
A cross-layer approach for stable throughput maximization under channel state uncertainty. Wirel. Networks 15(5): 555-569 (2009) - [r1]André L. Tits:
Feasible Sequential Quadratic Programming. Encyclopedia of Optimization 2009: 1001-1005 - 2008
- [j23]Cory D. Hauck, C. David Levermore, André L. Tits:
Convex Duality and Entropy-Based Moment Closures: Characterizing Degenerate Densities. SIAM J. Control. Optim. 47(4): 1977-2015 (2008) - [c2]Cory D. Hauck, C. David Levermore, André L. Tits:
Convex duality and entropy-based moment closures: Characterizing degenerate densities. CDC 2008: 5092-5097 - 2007
- [j22]Pierre-Antoine Absil, André L. Tits:
Newton-KKT interior-point methods for indefinite quadratic programming. Comput. Optim. Appl. 36(1): 5-41 (2007) - [j21]Simon P. Schurr, André L. Tits, Dianne P. O'Leary:
Universal duality in conic convex optimization. Math. Program. 109(1): 69-88 (2007) - [c1]Anna Pantelidou, Anthony Ephremides, André L. Tits:
Joint Scheduling and Routing for Ad-hoc Networks Under Channel State Uncertainty. WiOpt 2007: 1-8 - 2006
- [j20]André L. Tits, Pierre-Antoine Absil, William P. Woessner:
Constraint Reduction for Linear Programs with Many Inequality Constraints. SIAM J. Optim. 17(1): 119-146 (2006) - 2003
- [j19]Sasan Bakhtiari, André L. Tits:
A Simple Primal-Dual Feasible Interior-Point Method for Nonlinear Programming with Monotone Descent. Comput. Optim. Appl. 25(1-3): 17-38 (2003) - [j18]André L. Tits, Andreas Wächter, Sasan Bakhtiari, Thomas J. Urban, Craig T. Lawrence:
A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties. SIAM J. Optim. 14(1): 173-199 (2003) - 2002
- [j17]André L. Tits:
Comment on "The use of Routh array for testing the Hurwitz property of a segment of polynomials". Autom. 38(3): 559-560 (2002) - 2001
- [j16]Craig T. Lawrence, André L. Tits:
A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm. SIAM J. Optim. 11(4): 1092-1118 (2001) - 2000
- [j15]Craig T. Lawrence, André L. Tits, Paul Van Dooren:
A fast algorithm for the computation of an upper bound on the µ-norm. Autom. 36(3): 449-456 (2000) - [j14]Amit A. Kale, André L. Tits:
On Kharitonov's theorem without invariant degree assumption. Autom. 36(7): 1075-1076 (2000) - [j13]André L. Tits, Yung-Shan Chou:
On mixed-µ synthesis. Autom. 36(7): 1077-1079 (2000)
1990 – 1999
- 1999
- [j12]André L. Tits, V. Balakrishnan, Li Lee:
Robustness under bounded uncertainty with phase information. IEEE Trans. Autom. Control. 44(1): 50-65 (1999) - [j11]Yung-Shan Chou, André L. Tits, V. Balakrishnan:
Stability multipliers and μ upper bounds: connections and implications for numerical verification of frequency domain conditions. IEEE Trans. Autom. Control. 44(5): 906-913 (1999) - 1998
- [j10]André L. Tits, V. Balakrishnan:
Small-μ theorems with frequency-dependent uncertainty bounds. Math. Control. Signals Syst. 11(3): 220-243 (1998) - [j9]Jian L. Zhou, André L. Tits:
Erratum: An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions. SIAM J. Optim. 8(1): 284-285 (1998) - 1996
- [j8]Jian L. Zhou, André L. Tits:
An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions. SIAM J. Optim. 6(2): 461-487 (1996) - [j7]André L. Tits, Yaguang Yang:
Globally convergent algorithms for robust pole assignment by state feedback. IEEE Trans. Autom. Control. 41(10): 1432-1452 (1996) - 1995
- [j6]André L. Tits, Michael K. H. Fan:
On the small-μ theorem. Autom. 31(8): 1199-1201 (1995) - [j5]Li Qiu, André L. Tits, Yaguang Yang:
On the computation of the real Hurwitz-stability radius. IEEE Trans. Autom. Control. 40(8): 1475-1476 (1995) - 1993
- [j4]Eliane R. Panier, André L. Tits:
On combining feasibility, descent and superlinear convergence in inequality constrained optimization. Math. Program. 59: 261-276 (1993) - [j3]Li Lee, André L. Tits:
On continuity/discontinuity in robustness indicators. IEEE Trans. Autom. Control. 38(10): 1551-1553 (1993) - 1990
- [j2]Lahcen Saydy, André L. Tits, Eyad H. Abed:
Guardian maps and the generalized stability of parametrized families of matrices and polynomials. Math. Control. Signals Syst. 3(4): 345-371 (1990)
1980 – 1989
- 1988
- [j1]William Nye, David C. Riley, Alberto L. Sangiovanni-Vincentelli, André L. Tits:
DELIGHT.SPICE: an optimization-based system for the design of integrated circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 7(4): 501-519 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
