André L. Tits

According to our database1, André L. Tits authored at least 33 papers between 1988 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Awards

IEEE Fellow

IEEE Fellow 1998, "For contributions to optimization-based design and robust control.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme.
Comput. Optim. Appl., 2019

2016
Positive Filtered P<sub>N</sub> Moment Closures for Linear Kinetic Equations.
SIAM J. Numer. Anal., 2016

2014
Addressing Rank Degeneracy in Constraint-Reduced Interior-Point Methods for Linear Optimization.
J. Optim. Theory Appl., 2014

Adaptive change of basis in entropy-based moment closures for linear kinetic equations.
J. Comput. Phys., 2014

Performance survey of robust pole placement methods.
Proceedings of the 53rd IEEE Conference on Decision and Control, 2014

2012
High-Order Entropy-Based Closures for Linear Transport in Slab Geometry II: A Computational Study of the Optimization Problem.
SIAM J. Sci. Comput., 2012

Infeasible constraint-reduced interior-point methods for linear optimization.
Optim. Methods Softw., 2012

A constraint-reduced variant of Mehrotra's predictor-corrector algorithm.
Comput. Optim. Appl., 2012

Adaptive constraint reduction for convex quadratic programming.
Comput. Optim. Appl., 2012

2009
Feasible Sequential Quadratic Programming.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

A cross-layer approach for stable throughput maximization under channel state uncertainty.
Wirel. Networks, 2009

A Polynomial-Time Interior-Point Method for Conic Optimization, With Inexact Barrier Evaluations.
SIAM J. Optim., 2009

2008
Convex Duality and Entropy-Based Moment Closures: Characterizing Degenerate Densities.
SIAM J. Control. Optim., 2008

2007
Universal duality in conic convex optimization.
Math. Program., 2007

Newton-KKT interior-point methods for indefinite quadratic programming.
Comput. Optim. Appl., 2007

Joint Scheduling and Routing for Ad-hoc Networks Under Channel State Uncertainty.
Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, 2007

2006
Constraint Reduction for Linear Programs with Many Inequality Constraints.
SIAM J. Optim., 2006

2003
A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties.
SIAM J. Optim., 2003

A Simple Primal-Dual Feasible Interior-Point Method for Nonlinear Programming with Monotone Descent.
Comput. Optim. Appl., 2003

2002
Comment on "The use of Routh array for testing the Hurwitz property of a segment of polynomials".
Autom., 2002

2001
A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm.
SIAM J. Optim., 2001

2000
On mixed-µ synthesis.
Autom., 2000

A fast algorithm for the computation of an upper bound on the µ-norm.
Autom., 2000

On Kharitonov's theorem without invariant degree assumption.
Autom., 2000

1999
Robustness under bounded uncertainty with phase information.
IEEE Trans. Autom. Control., 1999

Stability multipliers and μ upper bounds: connections and implications for numerical verification of frequency domain conditions.
IEEE Trans. Autom. Control., 1999

1998
Erratum: An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions.
SIAM J. Optim., 1998

Small-μ theorems with frequency-dependent uncertainty bounds.
Math. Control. Signals Syst., 1998

1996
An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions.
SIAM J. Optim., 1996

1995
On the small-μ theorem.
Autom., 1995

1993
On combining feasibility, descent and superlinear convergence in inequality constrained optimization.
Math. Program., 1993

1990
Guardian maps and the generalized stability of parametrized families of matrices and polynomials.
Math. Control. Signals Syst., 1990

1988
DELIGHT.SPICE: an optimization-based system for the design of integrated circuits.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1988


  Loading...