Ya-Xiang Yuan
According to our database1,
Ya-Xiang Yuan
authored at least 80 papers
between 1985 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
On csauthors.net:
Bibliography
2024
SIAM J. Optim., 2024
2023
J. Sci. Comput., April, 2023
J. Mach. Learn. Res., 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
CoRR, 2022
CoRR, 2022
2021
Exact Penalty Function for ℓ<sub>2, 1</sub> Norm Minimization over the Stiefel Manifold.
SIAM J. Optim., 2021
2020
SIAM J. Sci. Comput., 2020
SIAM J. Matrix Anal. Appl., 2020
2019
SIAM J. Sci. Comput., 2019
SIAM J. Sci. Comput., 2019
Optim. Methods Softw., 2019
Comput. Optim. Appl., 2019
2018
A SemiSmooth Newton Method for Semidefinite Programs and its Applications in Electronic Structure Calculations.
SIAM J. Sci. Comput., 2018
SIAM J. Matrix Anal. Appl., 2018
A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints.
SIAM J. Optim., 2018
2017
Optim. Methods Softw., 2017
Math. Program. Comput., 2017
Math. Comput., 2017
2016
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
SIAM J. Numer. Anal., 2015
Optim. Methods Softw., 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
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
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
IEEE Trans. Intell. Transp. Syst., 2010
Math. Program., 2010
A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties.
Math. Program., 2010
2008
An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints.
Optim. Methods Softw., 2008
Optim. Lett., 2008
2007
SIAM J. Optim., 2007
2006
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
2002
Comput. Optim. Appl., 2002
2001
Math. Comput., 2001
Ann. Oper. Res., 2001
A Predictor-Corrector Algorithm for QSDP Combining Dikin-Type and Newton Centering Steps.
Ann. Oper. Res., 2001
Ann. Oper. Res., 2001
2000
A Robust Algorithm for Optimization with General Equality and Inequality Constraints.
SIAM J. Sci. Comput., 2000
1999
SIAM J. Optim., 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
1991
1990
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
Math. Program., 1985
An only 2-step Q-superlinear convergence example for some algorithms that use reduced hessian approximations.
Math. Program., 1985