SWStephen J. Wright

Stephen J. Wright

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Stephen J. Wright has a total of 139 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Optimization in Theory and Practice

    by Stephen J. Wright

    Continuing the legacy of the International Congress of Mathematicians, these proceedings bring together presentations delivered by invited speakers at the 2026 Congress held in Philadelphia. Publis... Continuing the legacy of the International Congress of Mathematicians, these proceedings bring together presentations delivered by invited speakers at the 2026 Congress held in Philadelphia. Publis...

  • Open Access

    Revisiting Superlinear Convergence of Proximal Newton-Like Methods to Degenerate Solutions

    by Ching-Pei Lee, Stephen J. Wright

    We describe inexact proximal Newton-like methods for solving degenerate regularized optimization problems and for the broader problem of finding a zero of a generalized equation that is the sum of a continuous map and a maximal monotone operator. Superlinear convergence for both the distance to the solution set and a certain measure of first-order optimality can be achieved under a Hölderian error bound condition, including for problems in which the continuous map is nonmonotone, with Jacobian singular at the solution and not Lipschitz. Superlinear convergence is attainable even when the Jacobian is merely uniformly continuous, relaxing the standard Lipschitz assumption to its theoretical limit. For convex regularized optimization problems, we introduce a novel globalization strategy that ensures strict objective decrease and avoids the Maratos effect, attaining local $Q$-superlinear convergence without prior knowledge of problem parameters. Unit step size acceptance in our line search strategy does not rely on continuity or even existence of the Hessian of the smooth term in the objective, making the framework compatible with other potential candidates for superlinearly convergent updates.

  • Top Cited Papers
    Open Access

    Optimal design for linear models via gradient flow

    by Ruhui Jin, Martin Guerra, Qin Li, Stephen J. Wright

    Optimal experimental design (OED) aims to choose the observations in an experiment to be as informative as possible, according to certain statistical criteria. In the linear case (when the observations depend linearly on the unknown parameters), it seeks the optimal weights over rows of the design matrix $ {\mathbf{A}} $ under certain criteria. Classical OED assumes a discrete design space and thus a design matrix with finite dimensions. In many practical situations, however, the design space is continuous-valued, so that the OED problem is one of optimizing over a continuous-valued design space. The objective becomes a functional over the probability measure, instead of a function of a finite dimensional vector. This change of perspective requires a new set of techniques to optimize over probability measures, and Wasserstein gradient flow becomes a natural candidate. Both the first-order criticality and the convexity properties of the OED objective are presented. Computationally, the Monte Carlo particle method is used to translate the gradient flow equation formulation into a numerical algorithm. This algorithm is applied to two elliptic inverse problems.


  • On Squared-Variable Formulations

    by Lijun Ding, Stephen J. Wright

    We revisit a formulation technique for inequality constrained optimization problems that has been known for decades: the substitution of squared variables for nonnegative variables. Using this technique, inequality constraints are converted to equality constraints via the introduction of a squared-slack variable. Such formulations have the superficial advantage that inequality constraints can be dispensed with altogether. But there are clear disadvantages, not least being that first-order optimal points for the squared-variable reformulation may not correspond to first-order optimal points for the original problem because the Lagrange multipliers may have the wrong sign. Extending previous results, this paper shows that points satisfying approximate second-order optimality conditions for the squared-variable reformulation also, under certain conditions, satisfy approximate second-order optimality conditions for the original formulation and vice versa. Such results allow us to adapt complexity analysis of methods for equality constrained optimization to account for inequality constraints. On the algorithmic side, we examine squared-variable formulations for several interesting problem classes, including bound-constrained quadratic programming, linear programming, and nonnegative matrix factorization. We show that algorithms built on these formulations are surprisingly competitive with standard methods. For linear programming, we also examine the relationship between the squared-variable approach and primal-dual interior-point methods.


  • Open Access

    A Randomized Algorithm for Nonconvex Minimization With Inexact Evaluations and Complexity Guarantees

    by Shuyao Li, Stephen J. Wright

    We consider minimization of a smooth nonconvex function with inexact oracle access to gradient and Hessian (without assuming access to the function value) to achieve approximate second-order optimality. A novel feature of our method is that if an approximate direction of negative curvature is chosen as the step, we choose its sign to be positive or negative with equal probability. We allow gradients to be inexact (with a bound on their error relative to the size of the true quantity) and relax the coupling between inexactness thresholds for the first- and second-order optimality conditions. Our convergence analysis includes both an expectation bound based on martingale analysis and a high-probability bound based on concentration inequalities. We apply our algorithm to empirical risk minimization problems and obtain improved gradient sample complexity over existing works.


  • Open Access

    Towards Weaker Variance Assumptions for Stochastic Optimization

    by Ahmet Alacaoglu, Yura Malitsky, Stephen J. Wright

    We revisit a classical assumption for analyzing stochastic gradient algorithms where the squared norm of the stochastic subgradient (or the variance for smooth problems) is allowed to grow as fast as the squared norm of the optimization variable. We contextualize this assumption in view of its inception in the 1960s, its seemingly independent appearance in the recent literature, its relationship to weakest-known variance assumptions for analyzing stochastic gradient algorithms, and its relevance in deterministic problems for non-Lipschitz nonsmooth convex optimization. We build on and extend a connection recently made between this assumption and the Halpern iteration. For convex nonsmooth, and potentially stochastic, optimization, we analyze horizon-free, anytime algorithms with last-iterate rates. For problems beyond simple constrained optimization, such as convex problems with functional constraints or regularized convex-concave min-max problems, we obtain rates for optimality measures that do not require boundedness of the feasible set.

  • Open Access

    On Squared-Variable Formulations for Nonlinear Semidefinite programming

    by Lijun Ding, Stephen J. Wright

    In optimization problems involving smooth functions and real and matrix variables, that contain matrix semidefiniteness constraints, consider the following change of variables: Replace the positive semidefinite matrix $X \in \mathbb{S}^d$, where $\mathbb{S}^d$ is the set of symmetric matrices in $\mathbb{R}^{d\times d}$, by a matrix product $FF^\top$, where $F \in \mathbb{R}^{d \times d}$ or $F \in \mathbb{S}^d$. The formulation obtained in this way is termed ``squared variable," by analogy with a similar idea that has been proposed for real (scalar) variables. It is well known that points satisfying first-order conditions for the squared-variable reformulation do not necessarily yield first-order points for the original problem. There are closer correspondences between second-order points for the squared-variable reformulation and the original formulation. These are explored in this paper, along with correspondences between local minimizers of the two formulations.

  • Open Access

    A randomized algorithm for nonconvex minimization with inexact evaluations and complexity guarantees

    by Shuyao Li, Stephen J. Wright

    We consider minimization of a smooth nonconvex function with inexact oracle access to gradient and Hessian (without assuming access to the function value) to achieve approximate second-order optimality. A novel feature of our method is that if an approximate direction of negative curvature is chosen as the step, we choose its sense to be positive or negative with equal probability. We allow gradients to be inexact in a relative sense and relax the coupling between inexactness thresholds for the first- and second-order optimality conditions. Our convergence analysis includes both an expectation bound based on martingale analysis and a high-probability bound based on concentration inequalities. We apply our algorithm to empirical risk minimization problems and obtain improved gradient sample complexity over existing works.

  • Open Access

    Robust Second-Order Nonconvex Optimization and Its Application to Low Rank Matrix Sensing

    by Shuyao Li, Yu Cheng, Ilias Diakonikolas, Jelena Diakonikolas, Rong Ge, Stephen J. Wright

    Finding an approximate second-order stationary point (SOSP) is a well-studied and fundamental problem in stochastic nonconvex optimization with many applications in machine learning. However, this problem is poorly understood in the presence of outliers, limiting the use of existing nonconvex algorithms in adversarial settings. In this paper, we study the problem of finding SOSPs in the strong contamination model, where a constant fraction of datapoints are arbitrarily corrupted. We introduce a general framework for efficiently finding an approximate SOSP with \emph{dimension-independent} accuracy guarantees, using $\widetilde{O}({D^2}/ε)$ samples where $D$ is the ambient dimension and $ε$ is the fraction of corrupted datapoints. As a concrete application of our framework, we apply it to the problem of low rank matrix sensing, developing efficient and provably robust algorithms that can tolerate corruptions in both the sensing matrices and the measurements. In addition, we establish a Statistical Query lower bound providing evidence that the quadratic dependence on $D$ in the sample complexity is necessary for computationally efficient algorithms.