Ya-Xiang Yuan

According to our database1, Ya-Xiang Yuan authored at least 79 papers between 1985 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Generalized Truncated Moment Problems with Unbounded Sets.
J. Sci. Comput., April, 2023

Homogenization for polynomial optimization with unbounded sets.
Math. Program., 2023

On the Convergence of Stochastic Gradient Descent with Bandwidth-based Step Size.
J. Mach. Learn. Res., 2023

Low-rank optimization on Tucker tensor varieties.
CoRR, 2023

Linear convergence of Nesterov-1983 with the strong convexity.
CoRR, 2023

Optimization on product manifolds under a preconditioned metric.
CoRR, 2023

On Underdamped Nesterov's Acceleration.
CoRR, 2023

Riemannian preconditioned algorithms for tensor completion via tensor ring decomposition.
CoRR, 2023

2022
A class of smooth exact penalty function methods for optimization problems with orthogonality constraints.
Optim. Methods Softw., 2022

Linear Convergence of ISTA and FISTA.
CoRR, 2022

Revisiting the acceleration phenomenon via high-resolution differential equations.
CoRR, 2022

Proximal Subgradient Norm Minimization of ISTA and FISTA.
CoRR, 2022

Some Sharp Error Bounds for Multivariate Linear Interpolation and Extrapolation.
CoRR, 2022

Gradient Norm Minimization of Nesterov Acceleration: o(1/k<sup>3</sup>).
CoRR, 2022

2021
Exact Penalty Function for ℓ<sub>2, 1</sub> Norm Minimization over the Stiefel Manifold.
SIAM J. Optim., 2021

2020
Low-Rank Matrix Iteration Using Polynomial-Filtered Subspace Extraction.
SIAM J. Sci. Comput., 2020

Adaptive Low-Nonnegative-Rank Approximation for State Aggregation of Markov Chains.
SIAM J. Matrix Anal. Appl., 2020

2019
Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints.
SIAM J. Sci. Comput., 2019

Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints.
SIAM J. Sci. Comput., 2019

Stochastic proximal quasi-Newton methods for non-convex composite optimization.
Optim. Methods Softw., 2019

A subspace SQP method for equality constrained optimization.
Comput. Optim. Appl., 2019

2018
A SemiSmooth Newton Method for Semidefinite Programs and its Applications in Electronic Structure Calculations.
SIAM J. Sci. Comput., 2018

Adaptive Quadratically Regularized Newton Method for Riemannian Optimization.
SIAM J. Matrix Anal. Appl., 2018

A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints.
SIAM J. Optim., 2018

2017
Theory and application of p-regularized subproblems for p>2.
Optim. Methods Softw., 2017

On efficiently combining limited-memory and trust-region techniques.
Math. Program. Comput., 2017

Penalty methods with stochastic approximation for stochastic nonlinear programming.
Math. Comput., 2017

2016
Sum Rate Maximization for Non-Regenerative MIMO Relay Networks.
IEEE Trans. Signal Process., 2016

On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization.
Optim. Methods Softw., 2016

Nonlinear Stepsize Control Algorithms: Complexity Bounds for First- and Second-Order Optimality.
J. Optim. Theory Appl., 2016

2015
On the Analysis of the Discretized Kohn-Sham Density Functional Theory.
SIAM J. Numer. Anal., 2015

Feasible Method for Semi-Infinite Programs.
SIAM J. Optim., 2015

An augmented Lagrangian trust region method for equality constrained optimization.
Optim. Methods Softw., 2015

Obituary for Mike Powell.
Optim. Methods Softw., 2015

Recent advances in trust region algorithms.
Math. Program., 2015

On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization.
Math. Program., 2015

2014
On the Convergence of the Self-Consistent Field Iteration in Kohn-Sham Density Functional Theory.
SIAM J. Matrix Anal. Appl., 2014

Foreword.
Optim. Methods Softw., 2014

A regularized Newton method for monotone nonlinear equations and its application.
Optim. Methods Softw., 2014

2013
Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization.
SIAM J. Optim., 2013

A trust region method based on a new affine scaling technique for simple bounded optimization.
Optim. Methods Softw., 2013

Foreword: Special issue on the 8th International Conference on Optimization: Techniques and Applications.
Optim. Methods Softw., 2013

Stability and Allocation in a Three-Player Game.
Asia Pac. J. Oper. Res., 2013

2012
Low complexity interference alignment algorithms for desired signal power maximization problem of MIMO channels.
EURASIP J. Adv. Signal Process., 2012

2011
A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization.
SIAM J. Optim., 2011

A parallel decomposition algorithm for training multiclass kernel-based vector machines.
Optim. Methods Softw., 2011

Fast algorithm for beamforming problems in distributed communication of relay networks.
Proceedings of the IEEE International Conference on Acoustics, 2011

2010
Modeling and Algorithms of GPS Data Reduction for the Qinghai-Tibet Railway.
IEEE Trans. Intell. Transp. Syst., 2010

A short note on the Q-linear convergence of the steepest descent method.
Math. Program., 2010

A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties.
Math. Program., 2010

2008
Preface.
Optim. Methods Softw., 2008

An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints.
Optim. Methods Softw., 2008

Rigid versus unique determination of protein structures with geometric buildup.
Optim. Lett., 2008

2007
An Interior-Point Trust-Region Algorithm for General Symmetric Cone Programming.
SIAM J. Optim., 2007

2006
A new linearization method for quadratic assignment problems.
Optim. Methods Softw., 2006

A subspace implementation of quasi-Newton trust region methods for unconstrained optimization.
Numerische Mathematik, 2006

2005
On the Quadratic Convergence of the Levenberg-Marquardt Method without Nonsingularity Assumption.
Computing, 2005

2003
Foreword.
Optim. Methods Softw., 2003

2002
Modified Two-Point Stepsize Gradient Methods for Unconstrained Optimization.
Comput. Optim. Appl., 2002

2001
A three-parameter family of nonlinear conjugate gradient methods.
Math. Comput., 2001

A Conic Trust-Region Method for Nonlinearly Constrained Optimization.
Ann. Oper. Res., 2001

A Predictor-Corrector Algorithm for QSDP Combining Dikin-Type and Newton Centering Steps.
Ann. Oper. Res., 2001

An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimization.
Ann. Oper. Res., 2001

2000
A Robust Algorithm for Optimization with General Equality and Inequality Constraints.
SIAM J. Sci. Comput., 2000

Convergence Properties of Nonlinear Conjugate Gradient Methods.
SIAM J. Optim., 2000

On Local Solutions of the Celis--Dennis--Tapia Subproblem.
SIAM J. Optim., 2000

On the truncated conjugate gradient method.
Math. Program., 2000

1999
A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property.
SIAM J. Optim., 1999

Global convergence of the method of shortest residuals.
Numerische Mathematik, 1999

A note on quadratic forms.
Math. Program., 1999

1997
Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints.
SIAM J. Optim., 1997

A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization.
Math. Comput., 1997

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

1991
A trust region algorithm for equality constrained optimization.
Math. Program., 1991

1990
On a Subproblem of Trust Region Algorithms for Constrained Optimization.
Math. Program., 1990

1986
A recursive quadratic programming algorithm that uses differentiable exact penalty functions.
Math. Program., 1986

1985
On the superlinear convergence of a trust region algorithm for nonsmooth optimization.
Math. Program., 1985

Conditions for convergence of trust region algorithms for nonsmooth optimization.
Math. Program., 1985

An only 2-step Q-superlinear convergence example for some algorithms that use reduced hessian approximations.
Math. Program., 1985


  Loading...