The following pages link to Ya-Xiang Yuan (Q384208):
Displaying 50 items.
- (Q2725276) (← links)
- (Q2732184) (← links)
- (Q2760092) (← links)
- On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization (Q2815548) (← links)
- STABILITY AND ALLOCATION IN A THREE-PLAYER GAME (Q2846496) (← links)
- Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization (Q2866196) (← links)
- A trust region method based on a new affine scaling technique for simple bounded optimization (Q2867413) (← links)
- On the Convergence of the Self-Consistent Field Iteration in Kohn--Sham Density Functional Theory (Q2923358) (← links)
- An augmented Lagrangian trust region method for equality constrained optimization (Q2943835) (← links)
- Obituary for Mike Powell (Q2943841) (← links)
- Penalty methods with stochastic approximation for stochastic nonlinear programming (Q2970100) (← links)
- Gradient Methods for Large Scale Convex Quadratic Functions (Q3001310) (← links)
- A New Trust-Region Algorithm for Nonlinear Constrained Optimization (Q3071328) (← links)
- (Q3076653) (← links)
- Componentwise error bounds for linear complementarity problems (Q3078369) (← links)
- A parallel decomposition algorithm for training multiclass kernel-based vector machines (Q3093054) (← links)
- A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization (Q3093594) (← links)
- (Q3129102) (← links)
- (Q3176077) (← links)
- Adaptive Quadratically Regularized Newton Method for Riemannian Optimization (Q3176355) (← links)
- On the Least Q-order of Convergence of Variable Metric Algorithms (Q3219030) (← links)
- An Example of Only Linear Convergence of Trust Region Algorithms for Non-smooth Optimization (Q3219031) (← links)
- Low-Rank Matrix Iteration Using Polynomial-Filtered Subspace Extraction (Q3300851) (← links)
- (Q3308508) (← links)
- Conditions for Superlinear Convergence in l1 and l Solutions of Overdetermined Non-linear Equations (Q3336592) (← links)
- A Modified BFGS Algorithm for Unconstrained Optimization (Q3359665) (← links)
- A new linearization method for quadratic assignment problems (Q3423596) (← links)
- Feasible Method for Semi-Infinite Programs (Q3461986) (← links)
- (Q3483100) (← links)
- An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints (Q3539793) (← links)
- (Q3609585) (← links)
- (Q3626659) (← links)
- (Q3632189) (← links)
- An only 2-step Q-superlinear convergence example for some algorithms that use reduced hessian approximations (Q3680620) (← links)
- Conditions for convergence of trust region algorithms for nonsmooth optimization (Q3696877) (← links)
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization (Q3698656) (← links)
- A recursive quadratic programming algorithm that uses differentiable exact penalty functions (Q3734178) (← links)
- (Q3771507) (← links)
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems (Q3805796) (← links)
- (Q3835936) (← links)
- (Q3840111) (← links)
- (Q3840113) (← links)
- (Q3840115) (← links)
- (Q3990277) (← links)
- (Q4022157) (← links)
- (Q4226745) (← links)
- (Q4306792) (← links)
- (Q4307592) (← links)
- (Q4359729) (← links)
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization (Q4372656) (← links)
