default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYa-Xiang Yuan
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j69]Lei Huang
, Jiawang Nie, Ya-Xiang Yuan:
Finite Convergence of Moment-SOS Relaxations with Nonreal Radical Ideals. SIAM J. Optim. 34(4): 3399-3428 (2024)- 2023
- [j68]Xiaoyu Wang, Yaxiang Yuan:
On the Convergence of Stochastic Gradient Descent with Bandwidth-based Step Size. J. Mach. Learn. Res. 24: 48:1-48:49 (2023) - [j67]Lei Huang, Jiawang Nie, Ya-Xiang Yuan:
Generalized Truncated Moment Problems with Unbounded Sets. J. Sci. Comput. 95(1): 15 (2023) - [j66]Lei Huang, Jiawang Nie, Ya-Xiang Yuan:
Homogenization for polynomial optimization with unbounded sets. Math. Program. 200(1): 105-145 (2023) - [i11]Bin Gao, Renfeng Peng, Ya-Xiang Yuan:
Riemannian preconditioned algorithms for tensor completion via tensor ring decomposition. CoRR abs/2302.14456 (2023) - [i10]Shuo Chen, Bin Shi, Ya-Xiang Yuan:
On Underdamped Nesterov's Acceleration. CoRR abs/2304.14642 (2023) - [i9]Bin Gao, Renfeng Peng, Ya-Xiang Yuan:
Optimization on product manifolds under a preconditioned metric. CoRR abs/2306.08873 (2023) - [i8]Bowen Li, Bin Shi, Ya-Xiang Yuan:
Linear convergence of Nesterov-1983 with the strong convexity. CoRR abs/2306.09694 (2023) - [i7]Bin Gao, Renfeng Peng, Ya-Xiang Yuan:
Low-rank optimization on Tucker tensor varieties. CoRR abs/2311.18324 (2023) - 2022
- [j65]Nachuan Xiao, Xin Liu, Ya-Xiang Yuan:
A class of smooth exact penalty function methods for optimization problems with orthogonality constraints. Optim. Methods Softw. 37(4): 1205-1241 (2022) - [i6]Lei Huang, Jiawang Nie, Ya-Xiang Yuan:
Generalized truncated moment problems with unbounded sets. CoRR abs/2208.00354 (2022) - [i5]Shuo Chen, Bin Shi, Ya-Xiang Yuan:
Gradient Norm Minimization of Nesterov Acceleration: o(1/k3). CoRR abs/2209.08862 (2022) - [i4]Liyuan Cao, Zaiwen Wen, Ya-Xiang Yuan:
Some Sharp Error Bounds for Multivariate Linear Interpolation and Extrapolation. CoRR abs/2209.12606 (2022) - [i3]Bowen Li, Bin Shi, Ya-Xiang Yuan:
Proximal Subgradient Norm Minimization of ISTA and FISTA. CoRR abs/2211.01610 (2022) - [i2]Shuo Chen, Bin Shi, Ya-Xiang Yuan:
Revisiting the acceleration phenomenon via high-resolution differential equations. CoRR abs/2212.05700 (2022) - [i1]Bowen Li, Bin Shi, Ya-Xiang Yuan:
Linear Convergence of ISTA and FISTA. CoRR abs/2212.06319 (2022) - 2021
- [j64]Nachuan Xiao, Xin Liu, Ya-Xiang Yuan:
Exact Penalty Function for ℓ2, 1 Norm Minimization over the Stiefel Manifold. SIAM J. Optim. 31(4): 3097-3126 (2021) - 2020
- [j63]Yaqi Duan, Mengdi Wang, Zaiwen Wen, Yaxiang Yuan:
Adaptive Low-Nonnegative-Rank Approximation for State Aggregation of Markov Chains. SIAM J. Matrix Anal. Appl. 41(1): 244-278 (2020) - [j62]Yongfeng Li, Haoyang Liu, Zaiwen Wen, Ya-Xiang Yuan:
Low-Rank Matrix Iteration Using Polynomial-Filtered Subspace Extraction. SIAM J. Sci. Comput. 42(3): A1686-A1713 (2020)
2010 – 2019
- 2019
- [j61]Jae Hwa Lee, Yoon Mo Jung, Ya-Xiang Yuan, Sangwoon Yun:
A subspace SQP method for equality constrained optimization. Comput. Optim. Appl. 74(1): 177-194 (2019) - [j60]Xiaoyu Wang, Xiao Wang, Ya-Xiang Yuan:
Stochastic proximal quasi-Newton methods for non-convex composite optimization. Optim. Methods Softw. 34(5): 922-948 (2019) - [j59]Bin Gao, Xin Liu, Ya-Xiang Yuan:
Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints. SIAM J. Sci. Comput. 41(3): A1949-A1983 (2019) - [j58]Jiang Hu, Bo Jiang, Lin Lin, Zaiwen Wen, Ya-Xiang Yuan:
Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints. SIAM J. Sci. Comput. 41(4): A2239-A2269 (2019) - 2018
- [j57]Bin Gao, Xin Liu, Xiaojun Chen, Ya-Xiang Yuan:
A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints. SIAM J. Optim. 28(1): 302-332 (2018) - [j56]Jiang Hu, Andre Milzarek, Zaiwen Wen, Yaxiang Yuan:
Adaptive Quadratically Regularized Newton Method for Riemannian Optimization. SIAM J. Matrix Anal. Appl. 39(3): 1181-1207 (2018) - [j55]Yongfeng Li, Zaiwen Wen, Chao Yang, Ya-Xiang Yuan:
A SemiSmooth Newton Method for Semidefinite Programs and its Applications in Electronic Structure Calculations. SIAM J. Sci. Comput. 40(6): A4131-A4157 (2018) - 2017
- [j54]Xiao Wang, Shiqian Ma, Ya-Xiang Yuan:
Penalty methods with stochastic approximation for stochastic nonlinear programming. Math. Comput. 86(306): 1793-1820 (2017) - [j53]Oleg Burdakov, Lujin Gong, Spartak Zikrin, Ya-Xiang Yuan:
On efficiently combining limited-memory and trust-region techniques. Math. Program. Comput. 9(1): 101-134 (2017) - [j52]Yong Hsia, Ruey-Lin Sheu, Ya-Xiang Yuan:
Theory and application of p-regularized subproblems for p>2. Optim. Methods Softw. 32(5): 1078-1094 (2017) - 2016
- [j51]Geovani Nunes Grapiglia, Jin Yun Yuan, Ya-Xiang Yuan:
Nonlinear Stepsize Control Algorithms: Complexity Bounds for First- and Second-Order Optimality. J. Optim. Theory Appl. 171(3): 980-997 (2016) - [j50]Geovani Nunes Grapiglia, Jin Yun Yuan, Ya-Xiang Yuan:
On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization. Optim. Methods Softw. 31(3): 591-604 (2016) - [j49]Cong Sun, Eduard Axel Jorswieck, Ya-Xiang Yuan:
Sum Rate Maximization for Non-Regenerative MIMO Relay Networks. IEEE Trans. Signal Process. 64(24): 6392-6405 (2016) - 2015
- [j48]Ya-Xiang Yuan:
Recent advances in trust region algorithms. Math. Program. 151(1): 249-281 (2015) - [j47]Geovani Nunes Grapiglia, Jin Yun Yuan, Ya-Xiang Yuan:
On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization. Math. Program. 152(1-2): 491-520 (2015) - [j46]Xiao Wang, Yaxiang Yuan:
An augmented Lagrangian trust region method for equality constrained optimization. Optim. Methods Softw. 30(3): 559-582 (2015) - [j45]Coralia Cartis, Andreas Griewank, Philippe L. Toint, Ya-Xiang Yuan:
Obituary for Mike Powell. Optim. Methods Softw. 30(3): 669-671 (2015) - [j44]Shuxiong Wang, Yaxiang Yuan:
Feasible Method for Semi-Infinite Programs. SIAM J. Optim. 25(4): 2537-2560 (2015) - [j43]Xin Liu, Zaiwen Wen, Xiao Wang, Michael Ulbrich, Yaxiang Yuan:
On the Analysis of the Discretized Kohn-Sham Density Functional Theory. SIAM J. Numer. Anal. 53(4): 1758-1785 (2015) - 2014
- [j42]Jinyan Fan, Yaxiang Yuan:
A regularized Newton method for monotone nonlinear equations and its application. Optim. Methods Softw. 29(1): 102-119 (2014) - [j41]Xiaoling Sun, Ya-Xiang Yuan:
Foreword. Optim. Methods Softw. 29(2): 223 (2014) - [j40]Xin Liu, Xiao Wang, Zaiwen Wen, Ya-Xiang Yuan:
On the Convergence of the Self-Consistent Field Iteration in Kohn-Sham Density Functional Theory. SIAM J. Matrix Anal. Appl. 35(2): 546-558 (2014) - 2013
- [j39]Leqin Wu, Xin Chen, Ye Lu, Ya-Xiang Yuan:
Stability and Allocation in a Three-Player Game. Asia Pac. J. Oper. Res. 30(3) (2013) - [j38]Jie Sun, Xiaoling Sun, Ya-Xiang Yuan:
Foreword: Special issue on the 8th International Conference on Optimization: Techniques and Applications. Optim. Methods Softw. 28(4): 669 (2013) - [j37]Xiao Wang, Ya-Xiang Yuan:
A trust region method based on a new affine scaling technique for simple bounded optimization. Optim. Methods Softw. 28(4): 871-888 (2013) - [j36]Xiaojun Chen, Lingfeng Niu, Yaxiang Yuan:
Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization. SIAM J. Optim. 23(3): 1528-1552 (2013) - 2012
- [j35]Cong Sun, Yunchuan Yang, Yaxiang Yuan:
Low complexity interference alignment algorithms for desired signal power maximization problem of MIMO channels. EURASIP J. Adv. Signal Process. 2012: 137 (2012) - 2011
- [j34]Lingfeng Niu, Yaxiang Yuan:
A parallel decomposition algorithm for training multiclass kernel-based vector machines. Optim. Methods Softw. 26(3): 431-454 (2011) - [j33]Xinwei Liu, Yaxiang Yuan:
A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization. SIAM J. Optim. 21(2): 545-571 (2011) - [c1]Cong Sun, Yaxiang Yuan:
Fast algorithm for beamforming problems in distributed communication of relay networks. ICASSP 2011: 3304-3307 - 2010
- [j32]Ya-Xiang Yuan:
A short note on the Q-linear convergence of the steepest descent method. Math. Program. 123(2): 339-343 (2010) - [j31]Xinwei Liu, Yaxiang Yuan:
A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties. Math. Program. 125(1): 163-193 (2010) - [j30]Dewang Chen, Yun-Shan Fu, Baigen Cai, Ya-Xiang Yuan:
Modeling and Algorithms of GPS Data Reduction for the Qinghai-Tibet Railway. IEEE Trans. Intell. Transp. Syst. 11(3): 753-758 (2010)
2000 – 2009
- 2008
- [j29]Di Wu, Zhijun Wu, Yaxiang Yuan:
Rigid versus unique determination of protein structures with geometric buildup. Optim. Lett. 2(3): 319-331 (2008) - [j28]Philippe L. Toint, Ya-Xiang Yuan:
Preface. Optim. Methods Softw. 23(2): 175-176 (2008) - [j27]Ye Lu, Ya-Xiang Yuan:
An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints. Optim. Methods Softw. 23(2): 251-258 (2008) - 2007
- [j26]Ye Lu, Ya-Xiang Yuan:
An Interior-Point Trust-Region Algorithm for General Symmetric Cone Programming. SIAM J. Optim. 18(1): 65-86 (2007) - 2006
- [j25]Zhouhong Wang, Ya-Xiang Yuan:
A subspace implementation of quasi-Newton trust region methods for unconstrained optimization. Numerische Mathematik 104(2): 241-269 (2006) - [j24]Yong Xia, Ya-Xiang Yuan:
A new linearization method for quadratic assignment problems. Optim. Methods Softw. 21(5): 805-818 (2006) - 2005
- [j23]Jinyan Fan, Ya-Xiang Yuan:
On the Quadratic Convergence of the Levenberg-Marquardt Method without Nonsingularity Assumption. Computing 74(1): 23-39 (2005) - 2003
- [j22]Masao Fukushima, Ya-Xiang Yuan:
Foreword. Optim. Methods Softw. 18(2): 127 (2003) - 2002
- [j21]Yu-Hong Dai, Jin Yun Yuan, Ya-Xiang Yuan:
Modified Two-Point Stepsize Gradient Methods for Unconstrained Optimization. Comput. Optim. Appl. 22(1): 103-109 (2002) - 2001
- [j20]Y. H. Dai, Ya-Xiang Yuan:
An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimization. Ann. Oper. Res. 103(1-4): 33-47 (2001) - [j19]Jiawang Nie, Ya-Xiang Yuan:
A Predictor-Corrector Algorithm for QSDP Combining Dikin-Type and Newton Centering Steps. Ann. Oper. Res. 103(1-4): 115-133 (2001) - [j18]Wenyu Sun, Ya-Xiang Yuan:
A Conic Trust-Region Method for Nonlinearly Constrained Optimization. Ann. Oper. Res. 103(1-4): 175-191 (2001) - [j17]Yu-Hong Dai, Ya-Xiang Yuan:
A three-parameter family of nonlinear conjugate gradient methods. Math. Comput. 70(235): 1155-1167 (2001) - 2000
- [j16]Ya-Xiang Yuan:
On the truncated conjugate gradient method. Math. Program. 87(3): 561-573 (2000) - [j15]Yu-Hong Dai, Jiye Han, Guanghui Liu, Defeng Sun, Hongxia Yin, Ya-Xiang Yuan:
Convergence Properties of Nonlinear Conjugate Gradient Methods. SIAM J. Optim. 10(2): 345-358 (2000) - [j14]Xiongda Chen, Ya-Xiang Yuan:
On Local Solutions of the Celis--Dennis--Tapia Subproblem. SIAM J. Optim. 10(2): 359-383 (2000) - [j13]Xinwei Liu, Yaxiang Yuan:
A Robust Algorithm for Optimization with General Equality and Inequality Constraints. SIAM J. Sci. Comput. 22(2): 517-534 (2000)
1990 – 1999
- 1999
- [j12]Xin Chen, Ya-Xiang Yuan:
A note on quadratic forms. Math. Program. 86(1): 187-197 (1999) - [j11]Yu-Hong Dai, Ya-Xiang Yuan:
Global convergence of the method of shortest residuals. Numerische Mathematik 83(4): 581-598 (1999) - [j10]Y. H. Dai, Ya-Xiang Yuan:
A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property. SIAM J. Optim. 10(1): 177-182 (1999) - 1997
- [j9]Q. Ni, Ya-Xiang Yuan:
A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization. Math. Comput. 66(220): 1509-1520 (1997) - [j8]Ji-Ming Peng, Ya-Xiang Yuan:
Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints. SIAM J. Optim. 7(3): 579-594 (1997) - 1993
- [j7]Jorge Nocedal, Ya-Xiang Yuan:
Analysis of a self-scaling quasi-Newton method. Math. Program. 61: 19-37 (1993) - 1991
- [j6]M. J. D. Powell, Ya-Xiang Yuan:
A trust region algorithm for equality constrained optimization. Math. Program. 49: 189-211 (1991) - 1990
- [j5]Ya-Xiang Yuan:
On a Subproblem of Trust Region Algorithms for Constrained Optimization. Math. Program. 47: 53-63 (1990)
1980 – 1989
- 1986
- [j4]M. J. D. Powell, Ya-Xiang Yuan:
A recursive quadratic programming algorithm that uses differentiable exact penalty functions. Math. Program. 35(3): 265-278 (1986) - 1985
- [j3]Ya-Xiang Yuan:
Conditions for convergence of trust region algorithms for nonsmooth optimization. Math. Program. 31(2): 220-228 (1985) - [j2]Ya-Xiang Yuan:
On the superlinear convergence of a trust region algorithm for nonsmooth optimization. Math. Program. 31(3): 269-285 (1985) - [j1]Ya-Xiang Yuan:
An only 2-step Q-superlinear convergence example for some algorithms that use reduced hessian approximations. Math. Program. 32(2): 224-231 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
