The following pages link to Stephen J. Wright (Q173847):
Displayed 50 items.
- Item:Q173847 (redirect page) (← links)
- A proximal method for composite minimization (Q304260) (← links)
- Duality-based algorithms for total-variation-regularized image restoration (Q616786) (← links)
- Conditions under which suboptimal nonlinear MPC is inherently robust (Q645583) (← links)
- LASSO-pattern search algorithm with application to ophthalmology and genomic data (Q660040) (← links)
- Cooperative distributed model predictive control (Q709271) (← links)
- Solution of discrete-time optimal control problems on parallel computers (Q753431) (← links)
- Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties (Q879968) (← links)
- Fast, large-scale model predictive control by partial enumeration (Q883382) (← links)
- Local convergence of an algorithm for subspace identification from partial data (Q887156) (← links)
- An accelerated Newton method for equations with semismooth jacobians and nonlinear complementarity problems (Q959978) (← links)
- Data assimilation in weather forecasting: a case study in PDE-constrained optimization (Q1041378) (← links)
- Implementing proximal point methods for linear programming (Q1123124) (← links)
- An efficient parallel scheme for minimizing a sum of Euclidean norms (Q1123548) (← links)
- Sequential quadratic programming for certain parameter identification problems (Q1181898) (← links)
- Superlinear convergence of a stabilized SQP method to a degenerate solution (Q1273525) (← links)
- Parallel stable compactification for ODEs with parameters and multipoint conditions (Q1315828) (← links)
- Interior point methods for optimal control of discrete time systems (Q1321328) (← links)
- Local convergence of interior-point algorithms for degenerate monotone LCP (Q1326510) (← links)
- Stable parallel elimination for boundary value ODEs (Q1330389) (← links)
- An infeasible-interior-point algorithm for linear complementarity problems (Q1340065) (← links)
- Constraint identification and algorithm stabilization for degenerate nonlinear programs (Q1411635) (← links)
- Item:Q173847 (redirect page) (← links)
- The role of linear objective functions in barrier methods (Q1572683) (← links)
- Interior-point methods (Q1593831) (← links)
- Online learning for changing environments using coin betting (Q1688998) (← links)
- Local convergence of a primal-dual method for degenerate nonlinear programming (Q1812091) (← links)
- An inexact algorithm for composite nondifferentiable optimization (Q1823153) (← links)
- Decomposition algorithms for stochastic programming on a computational grid (Q1866131) (← links)
- Nonlinear model predictive control via feasibility-perturbed sequential quadratic programming (Q1876587) (← links)
- Superlinear primal-dual affine scaling algorithms for LCP (Q1908018) (← links)
- A path-following interior-point algorithm for linear and quadratic problems (Q1915907) (← links)
- A superquadratic infeasible-interior-point method for linear complementarity problems (Q1918925) (← links)
- Application of interior-point methods to model predictive control (Q1969532) (← links)
- Inexact variable metric stochastic block-coordinate descent for regularized optimization (Q1985280) (← links)
- Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints (Q1995981) (← links)
- Variable smoothing for weakly convex composite functions (Q2031930) (← links)
- Randomness and permutations in coordinate descent methods (Q2189444) (← links)
- A discrete least squares collocation method for two-dimensional nonlinear time-dependent partial differential equations (Q2222281) (← links)
- Robust dequantized compressive sensing (Q2252518) (← links)
- Coordinate descent algorithms (Q2349114) (← links)
- An \(\mathrm S\ell _1 \mathrm{LP}\)-active set approach for feasibility restoration in power systems (Q2358026) (← links)
- Inexact successive quadratic approximation for regularized optimization (Q2419525) (← links)
- The empirical behavior of sampling methods for stochastic programming (Q2507414) (← links)
- Adversarial classification via distributional robustness with Wasserstein ambiguity (Q2693647) (← links)
- (Q2712835) (← links)
- Effects of Finite-Precision Arithmetic on Interior-Point Methods for Nonlinear Programming (Q2719248) (← links)
- Superlinear Convergence of an Interior-Point Method Despite Dependent Constraints (Q2757630) (← links)
- Warm-Start Strategies in Interior-Point Methods for Linear Programming (Q2784437) (← links)
- An Extension of 3D Zernike Moments for Shape Description and Retrieval of Maps Defined in Rectangular Solids (Q2863926) (← links)