Andrew R. Conn

GEOMETRY OF INTERPOLATION SETS IN DERIVATIVE FREE OPTIMIZATION (2008)

Andrew R. Conn, Katya Scheinberg, N. Vicente

Abstract. We consider derivative free methods based on sampling approaches for nonlinear optimization problems where derivatives of the objective function are not available and cannot be directly...

Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation (2008)

Conn, Andrew R., Scheinberg, Katya, Vicente, Luís N.

In recent years there has been a considerable amount of work on the development of numerical methods for derivative-free optimization problems. Some of this work relies on the management of the...

4 (2007)

Andrew R. Conn, Dominique Orban

A primal-dual trust-region algorithm for minimizing a non-convex function subject to general inequality and linear equality constraints

Error Estimates And Poisedness In Multivariate Polynomial Interpolation (2007)

Andrew R. Conn, Katya Scheinberg, Luis N. Vicente, Is N. Vicente

We show how to derive error estimates between a function and its interpolating polynomial and between their corresponding derivatives. The derivation is based on a new de nition of well-poisedness...

Chandu Visweswariah (2007)

A. Haring, R. Conn, Chandu Visweswariah, Chandu Visweswariah, Chandu Visweswariah, Ruud Haring Andrew, ...

Noise can cause digital circuits to switch incorrectly, producing spurious results. It can also have adverse power, timing and reliability effects. Dynamic logic is particularly susceptible to...

Large-Scale Nonlinear Optimization in Circuit Tuning (2003)

Andreas Wachter, Chandu Visweswariah, U Visweswariah, Andrew R. Conn

Circuit tuning is an important task in the design of custom digital integrated circuits such as high-performance microprocessors. The goal is to improve certain aspects of the circuit, such as speed,...

Two-Step Algorithms for Nonlinear Optimization with Structured Applications (1999)

Andrew R. Conn, Luís N. Vicente, Chandu Visweswariah

In this paper we propose extensions to trust-region algorithms in which the classical step is augmented with a second step that we insist yields a decrease in the value of the objective function. The...

A Primal-Dual Trust-Region Algorithm for Minimizing a Non-convex Function Subject to General Inequality and Linear Equality Constraints (1999)

Andrew R. Conn, D. Orban, Ph. L. Toint, Chilton Oxfordshire England

A new primal-dual algorithm is proposed for the minimization of non-convex objective functions subject to general inequality and linear equality constraints. The method uses a primal-dual trustregion...

An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms (1999)

Knud D. Andersen, Edmund Christiansen, Andrew R. Conn, Michael L. Overton

The problem of minimizing a sum of Euclidean norms dates from the 17th century and may be the earliest example of duality in the mathematical programming literature. This nonsmooth optimization...

Noise Considerations in Circuit Optimization (1998)

Andrew R. Conn, Ruud A. Haring, Chandu Visweswariah

Noise can cause digital circuits to switch incorrectly and thus produce spurious results. Noise can also have adverse power, timing and reliability e ects. Dynamic logic is particularly susceptible...

An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms (1998)

Knud Andersen Edmund, Edmund Christiansen, Andrew R. Conn, Michael L. Overton

The problem of minimizing a sum of Euclidean norms dates from the 17th century and may be the earliest example of duality in the mathematical programming literature. This nonsmooth optimization...

Circuit optimization via adjoint Lagrangians (1997)

Andrew R. Conn, Ruud A. Haring, U Visweswariah, Chai Wah Wu

The circuit tuning problem is best approached by means of gradient-based nonlinear optimization algorithms. For large circuits, gradient computation can be the bottleneck in the optimization...

Optimization of custom MOS circuits by transistor sizing (1996)

Andrew R. Conn, Paula K. Coulman, Ruud A. Haring, Gregory L. Morrill, U Visweswariah

Optimization of a circuit by transistor sizing is often a slow, tedious and iterative manual process which relies on designer intuition. Circuit simulation is carried out in the inner loop of this...

Methods for Nonlinear Constraints in Optimization Calculations (1996)

Andrew R. Conn, Philippe L. Toint

Ten years ago, the broad consensus among researchers in constrained optimization was that sequential quadratic programming (SQP) methods were the methods of choice. While, in the long term, this...

A Primal-Dual Algorithm for Minimizing a Non-Convex Function Subject to Bound and Linear Equality Constraints (1996)

Andrew R. Conn, Philippe L. Toint

A new primal-dual algorithm is proposed for the minimization of non-convex objective functions subject to simple bounds and linear equality constraints. The method alternates between a classical...

An Efficient Algorithm for Nonlinear Minimax Problems (1990)

Conn, Andrew R., Li, Yuying

We present a new method for solving a nonlinear minimax problem. This new algorithm exploits the structure and characterisation of the solution whenever possible. The exploitation is based on the...

The Computational Structure and Characterization of Nonlinear Discrete Chebyshev Problems (1988)

Conn, Andrew R., Li, Yuying

We present the generalisation of some concepts in linear Chebyshev theory to the nonlinear case. We feel these generalisations capture the inherent structure and characteristics of the best Chebyshev...

On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem (1982)

Coleman, Thomas F., Conn, Andrew R.

In this paper we propose a new local quasi-Newton method to solve the equality constrained non-linear programming problem. The pivotal feature of the algorithm is that a projection of the Hessian of...

Generalizing the LINPACK Condition Estimator (1981)

Cline, A. K., Conn, Andrew R., Van Loan, Charles

Two generalizations of the Cline-Moler-Stewart-Wilkinson "LINPACK" condition estimator are described. One generalization combines the LINPACK notion of "look-ahead" with a new feature called...

Noise Considerations in Circuit Optimization

Andrew Conn Ruud, Andrew R. Conn, Ruud A. Haring, Chandu Visweswariah

Noise can cause digital circuits to switch incorrectly and thus produce spurious results. Noise can also have adverse power, timing and reliability effects. Dynamic logic is particularly susceptible...