Jorge Nocedal

Orcid: 0000-0002-9662-2730

Affiliations:
  • Northwestern University, Illinois, USA


According to our database1, Jorge Nocedal authored at least 74 papers between 1979 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Noise-Tolerant Optimization Methods for the Solution of a Robust Design Problem.
CoRR, 2024

2023
A trust region method for noisy unconstrained optimization.
Math. Program., November, 2023

Constrained Optimization in the Presence of Noise.
SIAM J. Optim., September, 2023

On the numerical performance of finite-difference-based methods for derivative-free optimization.
Optim. Methods Softw., March, 2023

2022
Adaptive Finite-Difference Interval Estimation for Noisy Derivative-Free Optimization.
SIAM J. Sci. Comput., August, 2022

A Noise-Tolerant Quasi-Newton Algorithm for Unconstrained Optimization.
SIAM J. Optim., 2022

2020
Analysis of the BFGS Method with Errors.
SIAM J. Optim., 2020

An investigation of Newton-Sketch and subsampled Newton methods.
Optim. Methods Softw., 2020

2019
Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods.
SIAM J. Optim., 2019

2018
Optimization Methods for Large-Scale Machine Learning.
SIAM Rev., 2018

Adaptive Sampling Strategies for Stochastic Optimization.
SIAM J. Optim., 2018

A Progressive Batching L-BFGS Method for Machine Learning.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minima.
Proceedings of the 5th International Conference on Learning Representations, 2017

2016
A Stochastic Quasi-Newton Method for Large-Scale Optimization.
SIAM J. Optim., 2016

A second-order method for convex l<sub>1</sub>-regularized optimization with active-set prediction.
Optim. Methods Softw., 2016

An inexact successive quadratic approximation method for L-1 regularized optimization.
Math. Program., 2016

A family of second-order methods for convex ℓ<sub>1</sub>-regularized optimization.
Math. Program., 2016

A Multi-Batch L-BFGS Method for Machine Learning.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2015
An algorithm for quadratic ℓ<sub>1</sub>-regularized optimization with a flexible active-set strategy.
Optim. Methods Softw., 2015

2014
An interior point method for nonlinear programming with infeasibility detection capabilities.
Optim. Methods Softw., 2014

2013
Second Order Methods for Optimizing Convex Matrix Functions and Sparse Covariance Clustering.
IEEE Trans. Speech Audio Process., 2013

Subspace Accelerated Matrix Splitting Algorithms for Asymmetric and Symmetric Linear Complementarity Problems.
SIAM J. Optim., 2013

On the use of piecewise linear models in nonlinear programming.
Math. Program., 2013

2012
A line search exact penalty method using steering rules.
Math. Program., 2012

Sample size selection in optimization methods for machine learning.
Math. Program., 2012

Newton-Like Methods for Sparse Inverse Covariance Estimation.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Second-order methods for L1 regularized problems in machine learning.
Proceedings of the 2012 IEEE International Conference on Acoustics, 2012

2011
Remark on "algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization".
ACM Trans. Math. Softw., 2011

On the Use of Stochastic Hessian Information in Optimization Methods for Machine Learning.
SIAM J. Optim., 2011

On the solution of complementarity problems arising in American options pricing.
Optim. Methods Softw., 2011

2010
Infeasibility Detection and SQP Methods for Nonlinear Optimization.
SIAM J. Optim., 2010

An inexact Newton method for nonconvex equality constrained optimization.
Math. Program., 2010

2009
Adaptive Barrier Update Strategies for Nonlinear Interior Methods.
SIAM J. Optim., 2009

A Matrix-Free Algorithm for Equality Constrained Optimization Problems with Rank-Deficient Jacobians.
SIAM J. Optim., 2009

On the geometry phase in model-based algorithms for derivative-free optimization.
Optim. Methods Softw., 2009

Fast and parallel algorithms for pricing American options: keynote.
Proceedings of the 2nd Workshop on High Performance Computational Finance, 2009

2008
An Inexact SQP Method for Equality Constrained Optimization.
SIAM J. Optim., 2008

Steering exact penalty methods for nonlinear programming.
Optim. Methods Softw., 2008

An algorithm for the fast solution of symmetric linear complementarity problems.
Numerische Mathematik, 2008

2007
Steplength selection in interior-point methods for quadratic programming.
Appl. Math. Lett., 2007

2006
Interior Methods for Mathematical Programs with Complementarity Constraints.
SIAM J. Optim., 2006

An interior algorithm for nonlinear optimization that combines line search and trust region steps.
Math. Program., 2006

A Numerical Study of Active-Set and Interior-Point Methods for Bound Constrained Optimization.
Proceedings of the Modeling, 2006

2005
On the Convergence of Successive Linear-Quadratic Programming Algorithms.
SIAM J. Optim., 2005

2004
On the convergence of Newton iterations to non-stationary points.
Math. Program., 2004

An algorithm for nonlinear optimization using linear programming and equality constrained subproblems.
Math. Program., 2004

A starting point strategy for nonlinear interior methods.
Appl. Math. Lett., 2004

2003
Feasible Interior Methods Using Slacks for Nonlinear Optimization.
Comput. Optim. Appl., 2003

Solving Optimization Problems Using Parallel and Grid Computing.
Proceedings of the 4th Mexican International Conference on Computer Science (ENC 2003), 2003

2002
Wedge trust region methods for derivative free optimization.
Math. Program., 2002

On the Behavior of the Gradient Norm in the Steepest Descent Method.
Comput. Optim. Appl., 2002

Enriched Methods for Large-Scale Unconstrained Optimization.
Comput. Optim. Appl., 2002

2001
Algorithm 809: PREQN: Fortran 77 subroutines for preconditioning the conjugate gradient method.
ACM Trans. Math. Softw., 2001

On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization.
SIAM J. Sci. Comput., 2001

2000
Automatic Preconditioning by Limited Memory Quasi-Newton Updating.
SIAM J. Optim., 2000

A trust region method based on interior point techniques for nonlinear programming.
Math. Program., 2000

Numerical Experience with a Reduced Hessian Method for Large Scale Constrained Optimization.
Comput. Optim. Appl., 2000

1999
An Interior Point Algorithm for Large-Scale Nonlinear Programming.
SIAM J. Optim., 1999

Numerical Optimization
Springer, ISBN: 978-0-387-22742-9, 1999

1998
On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization.
SIAM J. Optim., 1998

1997
Algorithm 778: L-BFGS-B: Fortran Subroutines for Large-Scale Bound-Constrained Optimization.
ACM Trans. Math. Softw., 1997

1995
A Limited Memory Algorithm for Bound Constrained Optimization.
SIAM J. Sci. Comput., 1995

A Reduced Hessian Method for Large-Scale Constrained Optimization.
SIAM J. Optim., 1995

1994
Representations of quasi-Newton matrices and their use in limited memory methods.
Math. Program., 1994

1993
Automatic Column Scaling Strategies for Quasi-Newton Methods.
SIAM J. Optim., 1993

Analysis of a self-scaling quasi-Newton method.
Math. Program., 1993

1992
Global Convergence Properties of Conjugate Gradient Methods for Optimization.
SIAM J. Optim., 1992

On the Behavior of Broyden's Class of Quasi-Newton Methods.
SIAM J. Optim., 1992

1991
A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization.
SIAM J. Optim., 1991

An analysis of reduced Hessian methods for constrained optimization.
Math. Program., 1991

1989
On the limited memory BFGS method for large scale optimization.
Math. Program., 1989

1985
Evaluation of Step Directions in Optimization Algorithms.
ACM Trans. Math. Softw., 1985

1982
Conjugate direction methods with variable storage.
Math. Program., 1982

1979
Analysis of a new algorithm for one-dimensional minimization.
Computing, 1979


  Loading...