default search action
Andrew Conn 0001
Person information
- affiliation: IBM T. J. Watson Research Center, Yorktown Heights, NY, USA
Other persons with the same name
- Andrew Conn 0002 (aka: Andrew T. Conn) — University of Bristol, UK (and 1 more)
- Andrew Conn 0003 (aka: Andrew F. Conn) — University of Pittsburgh, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j46]Sonia Cafieri, Andrew R. Conn, Marcel Mongeau:
Mixed-integer nonlinear and continuous optimization formulations for aircraft conflict avoidance via heading and speed deviations. Eur. J. Oper. Res. 310(2): 670-679 (2023) - [j45]Sonia Cafieri, Andrew R. Conn, Marcel Mongeau:
The continuous quadrant penalty formulation of logical constraints. Open J. Math. Optim. 4: 1-12 (2023) - 2020
- [c8]Sijia Liu, Parikshit Ram, Deepak Vijaykeerthy, Djallel Bouneffouf, Gregory Bramble, Horst Samulowitz, Dakuo Wang, Andrew Conn, Alexander G. Gray:
An ADMM Based Framework for AutoML Pipeline Configuration. AAAI 2020: 4892-4899
2010 – 2019
- 2019
- [i2]Sijia Liu, Parikshit Ram, Djallel Bouneffouf, Gregory Bramble, Andrew R. Conn, Horst Samulowitz, Alexander G. Gray:
Automated Machine Learning via ADMM. CoRR abs/1905.00424 (2019) - 2018
- [j44]Charles Audet, Andrew R. Conn, Sébastien Le Digabel, Mathilde Peyrega:
A progressive barrier derivative-free trust-region algorithm for constrained optimization. Comput. Optim. Appl. 71(2): 307-329 (2018) - [j43]Nadir Amaioua, Charles Audet, Andrew R. Conn, Sébastien Le Digabel:
Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm. Eur. J. Oper. Res. 268(1): 13-24 (2018) - 2016
- [c7]Jialei Wang, Peder A. Olsen, Andrew R. Conn, Aurélie C. Lozano:
Removing Clouds and Recovering Ground Observations in Satellite Image Sequences via Temporally Contiguous Robust Matrix Completion. CVPR 2016: 2754-2763 - [i1]Jialei Wang, Peder A. Olsen, Andrew R. Conn, Aurélie C. Lozano:
Removing Clouds and Recovering Ground Observations in Satellite Image Sequences via Temporally Contiguous Robust Matrix Completion. CoRR abs/1604.03915 (2016) - 2015
- [j42]Clement Peyronne, Andrew R. Conn, Marcel Mongeau, Daniel Delahaye:
Solving air traffic conflict problems via local continuous optimization. Eur. J. Oper. Res. 241(2): 502-512 (2015) - 2014
- [j41]Brage Rugstad Knudsen, Ignacio E. Grossmann, Bjarne A. Foss, Andrew R. Conn:
Lagrangian relaxation based decomposition for well scheduling in shale-gas systems. Comput. Chem. Eng. 63: 234-249 (2014) - 2013
- [j40]Vidar Gunnerud, Andrew R. Conn, Bjarne A. Foss:
Embedding structural information in simulation-based optimization. Comput. Chem. Eng. 53: 35-43 (2013) - [j39]Andrew R. Conn, Sébastien Le Digabel:
Use of quadratic models with mesh-adaptive direct search for constrained black box optimization. Optim. Methods Softw. 28(1): 139-158 (2013) - 2012
- [j38]Hongchao Zhang, Andrew R. Conn:
On the local convergence of a derivative-free algorithm for least-squares minimization. Comput. Optim. Appl. 51(2): 481-507 (2012) - [j37]Andrew R. Conn, Luís Nunes Vicente:
Bilevel derivative-free optimization and its application to robust optimization. Optim. Methods Softw. 27(3): 561-577 (2012) - 2010
- [j36]Andrew R. Conn, Léa A. Deleris, Jonathan R. M. Hosking, Tom Anders Thorstensen:
A simulation model for improving the maintenance of high cost systems, with application to an offshore oil installation. Qual. Reliab. Eng. Int. 26(7): 733-748 (2010) - [j35]Hongchao Zhang, Andrew R. Conn, Katya Scheinberg:
A Derivative-Free Algorithm for Least-Squares Minimization. SIAM J. Optim. 20(6): 3555-3576 (2010)
2000 – 2009
- 2009
- [b2]Andrew R. Conn, Katya Scheinberg, Luís Nunes Vicente:
Introduction to Derivative-Free Optimization. MPS-SIAM series on optimization 8, SIAM 2009, ISBN 978-0-89871-668-9, pp. I-XII, 1-277 - [j34]Andrew R. Conn, Katya Scheinberg, Luís Nunes Vicente:
Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points. SIAM J. Optim. 20(1): 387-415 (2009) - 2008
- [j33]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 W. Sawaya, Andreas Wächter:
An algorithmic framework for convex mixed integer nonlinear programs. Discret. Optim. 5(2): 186-204 (2008) - [j32]Andrew R. Conn, Katya Scheinberg, Luís Nunes Vicente:
Geometry of interpolation sets in derivative free optimization. Math. Program. 111(1-2): 141-172 (2008) - 2005
- [j31]Andreas Wächter, Chandramouli Visweswariah, Andrew R. Conn:
Large-scale nonlinear optimization in circuit tuning. Future Gener. Comput. Syst. 21(8): 1251-1262 (2005) - 2002
- [j30]Andrew R. Conn, F. Bruce Shepherd:
Foreword. Math. Program. 91(3): 399-400 (2002) - 2001
- [c6]Andrew R. Conn, Chandramouli Visweswariah:
Overview of continuous optimization advances and applications to circuit tuning. ISPD 2001: 74-81 - 2000
- [b1]Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint:
Trust Region Methods. MOS-SIAM Series on Optimization, SIAM 2000, ISBN 978-0-89871-460-9, pp. 1-942 - [j29]Andrew R. Conn, Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint:
A primal-dual trust-region algorithm for non-convex nonlinear programming. Math. Program. 87(2): 215-249 (2000) - [j28]Knud D. Andersen, Edmund Christiansen, Andrew R. Conn, Michael L. Overton:
An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms. SIAM J. Sci. Comput. 22(1): 243-262 (2000) - [j27]Chandramouli Visweswariah, Ruud A. Haring, Andrew R. Conn:
Noise considerations in circuit optimization. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(6): 679-690 (2000)
1990 – 1999
- 1999
- [j26]Andrew R. Conn, Luís Nunes Vicente, Chandu Visweswariah:
Two-Step Algorithms for Nonlinear Optimization with Structured Applications. SIAM J. Optim. 9(4): 924-947 (1999) - [c5]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 - [c4]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
- [j25]Andrew R. Conn, Marcel Mongeau:
Discontinuous piecewise linear optimization. Math. Program. 80: 315-380 (1998) - [j24]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. Comput. Aided Des. Integr. Circuits Syst. 17(12): 1292-1309 (1998) - [c3]Andrew R. Conn, Ruud A. Haring, Chandramouli Visweswariah:
Noise considerations in circuit optimization. ICCAD 1998: 220-227 - 1997
- [j23]Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint:
On the Number of Inner Iterations Per Outer Iteration of a Globally Convergent Algorithm for Optimization with General Nonlinear Inequality Constraints and Simple Bounds. Comput. Optim. Appl. 7(1): 41-69 (1997) - [j22]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) - [j21]Andrew R. Conn, Katya Scheinberg, Philippe L. Toint:
Recent progress in unconstrained nonlinear optimization without derivatives. Math. Program. 79: 397-414 (1997) - [c2]Andrew R. Conn, Ruud A. Haring, Chandramouli Visweswariah, Chai Wah Wu:
Circuit optimization via adjoint Lagrangians. ICCAD 1997: 281-288 - 1996
- [j20]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) - [j19]Andrew R. Conn, Nicholas I. M. Gould, Annick Sartenaer, Philippe L. Toint:
Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints. SIAM J. Optim. 6(3): 674-703 (1996) - [j18]Andrew R. Conn, Nick I. M. Gould, Annick Sartenaer, Philippe L. Toint:
Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region. SIAM J. Optim. 6(4): 1059-1086 (1996) - [j17]Benjamin Reiser, Betty J. Flehinger, Andrew R. Conn:
Estimating component-defect probability from masked system success/failure data. IEEE Trans. Reliab. 45(2): 238-243 (1996) - [c1]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 - 1995
- [j16]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
- [j15]Ingrid Bongartz, Paul H. Calamai, Andrew R. Conn:
A projection method for lp norm location-allocation problems. Math. Program. 66: 283-312 (1994) - [j14]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) - 1993
- [j13]Andrew R. Conn, Nick I. M. Gould, Annick Sartenaer, Philippe L. Toint:
Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints. SIAM J. Optim. 3(1): 164-221 (1993) - 1992
- [j12]Andrew R. Conn, Yuying Li:
A Structure-Exploiting Algorithm for Nonlinear Minimax Problems. SIAM J. Optim. 2(2): 242-263 (1992) - 1991
- [j11]A. B. Gamble, Andrew R. Conn, William R. Pulleyblank:
A network penalty method. Math. Program. 50: 53-73 (1991) - [j10]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) - 1990
- [j9]Andrew R. Conn, Gérard Cornuéjols:
A Projection Method for the Uncapacitated Facility Location Problem. Math. Program. 46: 273-298 (1990)
1980 – 1989
- 1987
- [j8]Andrew R. Conn, Nicholas I. M. Gould:
An exact penalty function for semi-infinite programming. Math. Program. 37(1): 19-40 (1987) - [j7]Paul H. Calamai, Andrew R. Conn:
A projected newton method for l p norm location problems. Math. Program. 38(1): 75-109 (1987) - 1982
- [j6]Thomas F. Coleman, Andrew R. Conn:
Nonlinear programming via an exact penalty function: Asymptotic analysis. Math. Program. 24(1): 123-136 (1982) - [j5]Thomas F. Coleman, Andrew R. Conn:
Nonlinear programming via an exact penalty function: Global analysis. Math. Program. 24(1): 137-161 (1982) - 1981
- [j4]Thomas F. Coleman, Andrew R. Conn:
Erratum. Math. Program. 21(1): 357 (1981) - 1980
- [j3]Thomas F. Coleman, Andrew R. Conn:
Second-order conditions for an exact penalty function. Math. Program. 19(1): 178-185 (1980) - [j2]Richard H. Bartels, Andrew R. Conn:
Linearly Constrained Discrete l1 Problems. ACM Trans. Math. Softw. 6(4): 594-608 (1980) - [j1]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)
Coauthor Index
aka: Nick I. M. Gould
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-11-11 22:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint