2008 |
23 | EE | Pierre Bonami,
Lorenz T. Biegler,
Andrew R. Conn,
Gérard Cornuéjols,
Ignacio E. Grossmann,
Carl D. Laird,
Jon Lee,
Andrea Lodi,
François Margot,
Nicolas Sawaya,
Andreas Wächter:
An algorithmic framework for convex mixed integer nonlinear programs.
Discrete Optimization 5(2): 186-204 (2008) |
22 | EE | Andrew R. Conn,
Katya Scheinberg,
Luís N. Vicente:
Geometry of interpolation sets in derivative free optimization.
Math. Program. 111(1-2): 141-172 (2008) |
2005 |
21 | EE | Andreas Wächter,
Chandramouli Visweswariah,
Andrew R. Conn:
Large-scale nonlinear optimization in circuit tuning.
Future Generation Comp. Syst. 21(8): 1251-1262 (2005) |
2001 |
20 | EE | Andrew R. Conn,
Chandramouli Visweswariah:
Overview of continuous optimization advances and applications to circuit tuning.
ISPD 2001: 74-81 |
2000 |
19 | EE | Chandramouli Visweswariah,
Ruud A. Haring,
Andrew R. Conn:
Noise considerations in circuit optimization.
IEEE Trans. on CAD of Integrated Circuits and Systems 19(6): 679-690 (2000) |
1999 |
18 | EE | Andrew R. Conn,
Ibrahim M. Elfadel,
W. W. Molzen,
P. R. O'Brien,
Philip N. Strenski,
Chandramouli Visweswariah,
C. B. Whan:
Gradient-Based Optimization of Custom Circuits Using a Static-Timing Formulation.
DAC 1999: 452-459 |
17 | EE | Chandramouli Visweswariah,
Andrew R. Conn:
Formulation of static circuit optimization with reduced size, degeneracy and redundancy by timing graph manipulation.
ICCAD 1999: 244-252 |
1998 |
16 | EE | Andrew R. Conn,
Ruud A. Haring,
Chandramouli Visweswariah:
Noise considerations in circuit optimization.
ICCAD 1998: 220-227 |
15 | EE | Andrew R. Conn,
Paula K. Coulman,
Ruud A. Haring,
Gregory L. Morrill,
Chandramouli Visweswariah,
Chai Wah Wu:
JiffyTune: circuit optimization using time-domain sensitivities.
IEEE Trans. on CAD of Integrated Circuits and Systems 17(12): 1292-1309 (1998) |
14 | | Andrew R. Conn,
Marcel Mongeau:
Discontinuous piecewise linear optimization.
Math. Program. 80: 315-380 (1998) |
1997 |
13 | EE | Andrew R. Conn,
Ruud A. Haring,
Chandramouli Visweswariah,
Chai Wah Wu:
Circuit optimization via adjoint Lagrangians.
ICCAD 1997: 281-288 |
12 | | Andrew R. Conn,
Nicholas I. M. Gould,
Philippe L. Toint:
A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds.
Math. Comput. 66(217): 261-288 (1997) |
11 | | Andrew R. Conn,
Katya Scheinberg,
Philippe L. Toint:
Recent progress in unconstrained nonlinear optimization without derivatives.
Math. Program. 79: 397-414 (1997) |
1996 |
10 | EE | Andrew R. Conn,
Paula K. Coulman,
Ruud A. Haring,
Gregory L. Morrill,
Chandramouli Visweswariah:
Optimization of custom MOS circuits by transistor sizing.
ICCAD 1996: 174-180 |
9 | | Andrew R. Conn,
Nicholas I. M. Gould,
Philippe L. Toint:
Numerical experiments with the LANCELOT package (Release A) for large-scale nonlinear optimization.
Math. Program. 73: 73-110 (1996) |
1995 |
8 | EE | Ingrid Bongartz,
Andrew R. Conn,
Nicholas I. M. Gould,
Philippe L. Toint:
CUTE: Constrained and Unconstrained Testing Environment.
ACM Trans. Math. Softw. 21(1): 123-160 (1995) |
1994 |
7 | | Ingrid Bongartz,
Paul H. Calamai,
Andrew R. Conn:
A projection method for lp norm location-allocation problems.
Math. Program. 66: 283-312 (1994) |
6 | | Andrew R. Conn,
Nicholas I. M. Gould,
Philippe L. Toint:
A note on exploiting structure when using slack variables.
Math. Program. 67: 89-97 (1994) |
1991 |
5 | | Andrew R. Conn,
Nicholas I. M. Gould,
Philippe L. Toint:
Convergence of quasi-Newton matrices generated by the symmetric rank one update.
Math. Program. 50: 177-195 (1991) |
4 | | A. B. Gamble,
Andrew R. Conn,
William R. Pulleyblank:
A network penalty method.
Math. Program. 50: 53-73 (1991) |
1990 |
3 | | Andrew R. Conn,
Gérard Cornuéjols:
A Projection Method for the Uncapacitated Facility Location Problem.
Math. Program. 46: 273-298 (1990) |
1980 |
2 | EE | Richard H. Bartels,
Andrew R. Conn:
Linearly Constrained Discrete l1 Problems.
ACM Trans. Math. Softw. 6(4): 594-608 (1980) |
1 | EE | Richard H. Bartels,
Andrew R. Conn:
Algorithm 563: A Program for Linearly Constrained Discrete l1 Problems.
ACM Trans. Math. Softw. 6(4): 609-614 (1980) |