Frank E. Curtis

Orcid: 0000-0001-7214-9187

Affiliations:
  • Lehigh University, Department of Industrial and Systems Engineering, Bethlehem, PA, USA


According to our database1, Frank E. Curtis authored at least 52 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization.
Math. Program., May, 2024

2023
Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization.
SIAM J. Optim., September, 2023

An inexact column-and-constraint generation method to solve two-stage robust optimization problems.
Oper. Res. Lett., January, 2023

Almost-sure convergence of iterates and multipliers in stochastic sequential quadratic optimization.
CoRR, 2023

A Stochastic-Gradient-based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems.
CoRR, 2023

A Variance-Reduced and Stabilized Proximal Stochastic Gradient Method with Support Identification Guarantees for Structured Optimization.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Gradient Sampling Methods with Inexact Subproblem Solutions and Gradient Aggregation.
INFORMS J. Optim., October, 2022

A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer.
SIAM J. Optim., 2022

A fully stochastic second-order trust region method.
Optim. Methods Softw., 2022

Limited-memory BFGS with displacement aggregation.
Math. Program., 2022

2021
Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization.
SIAM J. Optim., 2021

Sequential Quadratic Optimization for Nonlinear Equality Constrained Stochastic Optimization.
SIAM J. Optim., 2021

An accelerated communication-efficient primal-dual optimization framework for structured machine learning.
Optim. Methods Softw., 2021

Regional complexity analysis of algorithms for nonconvex smooth optimization.
Math. Program., 2021

2020
Adaptive Stochastic Optimization: A Framework for Analyzing Stochastic Optimization Algorithms.
IEEE Signal Process. Mag., 2020

Inexact Sequential Quadratic Optimization with Penalty Parameter Updates within the QP Solver.
SIAM J. Optim., 2020

ADMM for multiaffine constrained optimization.
Optim. Methods Softw., 2020

Adaptive Stochastic Optimization.
CoRR, 2020

2019
A Stochastic Trust Region Algorithm Based on Careful Step Normalization.
INFORMS J. Optim., July, 2019

Exploiting negative curvature in deterministic and stochastic optimization.
Math. Program., 2019

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

A Sequential Algorithm for Solving Nonlinear Optimization Problems with Chance Constraints.
SIAM J. Optim., 2018

Complexity Analysis of a Trust Funnel Algorithm for Equality Constrained Optimization.
SIAM J. Optim., 2018

FaRSA for ℓ1-regularized convex optimization: local convergence and numerical experience.
Optim. Methods Softw., 2018

Concise complexity analyses for trust region methods.
Optim. Lett., 2018

2017
A Reduced-Space Algorithm for Minimizing ℓ<sub>1</sub>-Regularized Convex Functions.
SIAM J. Optim., 2017

A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles.
Optim. Methods Softw., 2017

A trust region algorithm with a worst-case iteration complexity of O(ϵ <sup>-3/2</sup>) for nonconvex optimization.
Math. Program., 2017

An interior-point trust-funnel algorithm for nonlinear optimization.
Math. Program., 2017

Optimization Methods for Supervised Machine Learning: From Linear Models to Deep Learning.
CoRR, 2017

Solving nearly-separable quadratic optimization problems as nonsmooth equations.
Comput. Optim. Appl., 2017

2016
Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves.
SIAM J. Optim., 2016

Adaptive augmented Lagrangian methods: algorithms and practical numerical experience.
Optim. Methods Softw., 2016

A Self-Correcting Variable-Metric Algorithm for Stochastic Optimization.
Proceedings of the 33nd International Conference on Machine Learning, 2016

2015
Iterative Reweighted Linear Least Squares for Exact Penalty Subproblems on Product Sets.
SIAM J. Optim., 2015

A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees.
Math. Program. Comput., 2015

An adaptive augmented Lagrangian method for large-scale constrained optimization.
Math. Program., 2015

Primal-Dual Active-Set Methods for Isotonic Regression and Trend Filtering.
CoRR, 2015

A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization.
Comput. Optim. Appl., 2015

2014
An Inexact Sequential Quadratic Optimization Algorithm for Nonlinear Optimization.
SIAM J. Optim., 2014

A Sequential Quadratic Optimization Algorithm with Rapid Infeasibility Detection.
SIAM J. Optim., 2014

2013
An adaptive gradient sampling algorithm for non-smooth optimization.
Optim. Methods Softw., 2013

2012
A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization.
SIAM J. Optim., 2012

A penalty-interior-point algorithm for nonlinear constrained optimization.
Math. Program. Comput., 2012

A note on the implementation of an interior-point algorithm for nonlinear optimization with inexact step computations.
Math. Program., 2012

2010
An Interior-Point Algorithm for Large-Scale Nonlinear Optimization with Inexact Step Computations.
SIAM J. Sci. Comput., 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
A Matrix-Free Algorithm for Equality Constrained Optimization Problems with Rank-Deficient Jacobians.
SIAM J. Optim., 2009

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

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

2004
Central groupoids, central digraphs, and zero-one matrices A satisfying A<sup>2</sup>=J .
J. Comb. Theory, Ser. A, 2004


  Loading...