default search action
Yanqin Bai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j42]Qian Li, Wei Zhang
, Yanqin Bai, Guoqiang Wang
A non-convex piecewise quadratic approximation of ℓ 0 regularization: theory and accelerated algorithm. J. Glob. Optim. 86(2): 323-353 (2023) - [j41]Yan-Ru Guo, Yan-Qin Bai:
Two-dimensional k-subspace clustering and its applications on image recognition. Int. J. Mach. Learn. Cybern. 14(8): 2671-2683 (2023) - [j40]Qian Li, Wei Zhang, Guoqiang Wang
Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection. Optim. Methods Softw. 38(2): 434-456 (2023) - 2022
- [j39]Yan-Ru Guo, Yan-Qin Bai, Chun-Na Li
Two-dimensional Bhattacharyya bound linear discriminant analysis with its applications. Appl. Intell. 52(8): 8793-8809 (2022) - 2021
- [j38]Yan-Ru Guo, Yan-Qin Bai, Chun-Na Li, Yuan-Hai Shao, Ya-Fen Ye, Cheng-zi Jiang:
Reverse nearest neighbors Bhattacharyya bound linear discriminant analysis for multimodal classification. Eng. Appl. Artif. Intell. 97: 104033 (2021) - [j37]Xuerui Gao, Yanqin Bai, Qian Li:
A sparse optimization problem with hybrid L2 -Lp regularization for application of magnetic resonance brain images. J. Comb. Optim. 42(4): 760-784 (2021) - [c2]Tuo Deng, Astrid Manders, Arjo J. Segers, Yanqin Bai, Hai-Xiang Lin:
Temporal Transfer Learning for Ozone Prediction based on CNN-LSTM Model. ICAART (2) 2021: 1005-1012 - 2020
- [i1]Yan-Ru Guo, Yan-Qin Bai, Chun-Na Li, Lan Bai, Yuan-Hai Shao:
Two-dimensional Bhattacharyya bound linear discriminant analysis with its applications. CoRR abs/2011.05507 (2020)
2010 – 2019
- 2019
- [j36]Di Wu, Yanqin Bai, Changjun Yu:
A new computational approach for optimal control problems with multiple time-delay. Autom. 101: 388-395 (2019) - [j35]Liwei Zhong, Yanqin Bai:
Three-sided stable matching problem with two of them as cooperative partners. J. Comb. Optim. 37(1): 286-292 (2019) - [j34]Renli Liang, Yanqin Bai, Hai-Xiang Lin
An inexact splitting method for the subspace segmentation from incomplete and noisy observations. J. Glob. Optim. 73(2): 411-429 (2019) - [j33]Ximei Yang, Yanqin Bai:
An Adaptive Infeasible-Interior-Point Method with the One-Norm Wide Neighborhood for Semi-definite Programming. J. Sci. Comput. 78(3): 1790-1810 (2019) - [j32]Qian Li, Yanqin Bai, Xin Yan, Wei Zhang
Portfolio selection with the effect of systematic risk diversification: formulation and accelerated gradient algorithm. Optim. Methods Softw. 34(3): 612-633 (2019) - 2018
- [j31]Xin Li, Yanqin Bai, Yaxin Peng, Shaoyi Du, Shihui Ying:
Nonlinear Semi-Supervised Metric Learning Via Multiple Kernels and Local Topology. Int. J. Neural Syst. 28(2): 1750040:1-1750040:22 (2018) - [j30]Yaru Zhan, Yanqin Bai, Wei Zhang
A P-ADMM for sparse quadratic kernel-free least squares semi-supervised support vector machine. Neurocomputing 306: 37-50 (2018) - [j29]Liwei Zhong, Yanqin Bai:
Equivalence of two-sided stable matching. J. Comb. Optim. 36(4): 1380-1387 (2018) - [j28]Anwa Zhou
Tensor maximal correlation problems. J. Glob. Optim. 70(4): 843-858 (2018) - [j27]Xin Li, Yanqin Bai
Document Classification via Nonlinear Metric Learning. Neural Process. Lett. 48(3): 1335-1345 (2018) - [j26]Xin Yan, Yanqin Bai, Shu-Cherng Fang, Jian Luo:
A proximal quadratic surface support vector machine for semi-supervised binary classification. Soft Comput. 22(20): 6905-6919 (2018) - 2016
- [j25]Munawwar Ali Abbas, Yanqin Bai, Mohammad Mehdi Rashidi
Analysis of Entropy Generation in the Flow of Peristaltic Nanofluids in Channels With Compliant Walls. Entropy 18(3): 90 (2016) - [j24]Xin Yan, Yanqin Bai, Shu-Cherng Fang, Jian Luo:
A kernel-free quadratic surface support vector machine for semi-supervised learning. J. Oper. Res. Soc. 67(7): 1001-1011 (2016) - [j23]Yanqin Bai, Xin Yan:
Conic Relaxations for Semi-supervised Support Vector Machines. J. Optim. Theory Appl. 169(1): 299-313 (2016) - [j22]Qian Li, Yanqin Bai:
Optimal trade-off portfolio selection between total risk and maximum relative marginal risk. Optim. Methods Softw. 31(4): 681-700 (2016) - [j21]Yanqin Bai, Renli Liang, Zhouwang Yang:
Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables. Optim. Methods Softw. 31(5): 1089-1109 (2016) - [j20]Chun-Feng Wang
Global Optimization for Solving Linear Multiplicative Programming Based on a New Linearization Method. Sci. Program. 2016: 3204368:1-3204368:9 (2016) - 2015
- [j19]Jin-Bao Jian, Chuan-Hao Guo
A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization. J. Comput. Appl. Math. 273: 88-102 (2015) - [j18]Yanqin Bai, Xiao Han, Tong Chen, Hua Yu:
Quadratic kernel-free least squares support vector machine for target diseases classification. J. Comb. Optim. 30(4): 850-870 (2015) - [j17]Guoqiang Wang
Improved Complexity Analysis of Full Nesterov-Todd Step Interior-Point Methods for Semidefinite Optimization. J. Optim. Theory Appl. 165(1): 242-262 (2015) - 2013
- [j16]Changjun Yu, Kok Lay Teo, Yanqin Bai:
An exact penalty function method for nonlinear mixed discrete programming problems. Optim. Lett. 7(1): 23-38 (2013) - [j15]Lipu Zhang
A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function. Optim. Methods Softw. 28(3): 619-639 (2013) - 2012
- [j14]Yanqin Bai, Wei Xie, Jing Zhang:
New parameterized kernel functions for linear optimization. J. Glob. Optim. 54(2): 353-366 (2012) - [j13]Guo-Qiang Wang
A Class of Polynomial Interior Point Algorithms for the Cartesian P-Matrix Linear Complementarity Problem over Symmetric Cones. J. Optim. Theory Appl. 152(3): 739-772 (2012) - [j12]Guo-Qiang Wang
A New Full Nesterov-Todd Step Primal-Dual Path-Following Interior-Point Algorithm for Symmetric Optimization. J. Optim. Theory Appl. 154(3): 966-985 (2012) - [j11]Lipu Zhang
A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function. Numer. Algorithms 61(1): 57-81 (2012) - 2010
- [j10]Qin Wang, Yanqin Bai:
An Efficient Algorithm for Reverse 2-median Problem on A Cycle. J. Networks 5(10): 1169-1176 (2010) - [j9]Yan-Qin Bai, F. Y. Wang, X. W. Luo:
A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization. RAIRO Oper. Res. 44(3): 251-265 (2010)
2000 – 2009
- 2009
- [j8]Guo-Qiang Wang, Yan-Qin Bai:
A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step. Appl. Math. Comput. 215(3): 1047-1061 (2009) - [j7]Guo-Qiang Wang
Polynomial interior-point algorithms for P*(k) horizontal linear complementarity problem. J. Comput. Appl. Math. 233(2): 248-263 (2009) - [j6]Mohamed El Ghami
Kernel-function Based Algorithms for Semidefinite Optimization. RAIRO Oper. Res. 43(2): 189-199 (2009) - [c1]Guoqiang Wang, Yanqin Bai:
A Primal-Dual Interior-Point Algorithm for Convex Quadratic Optimization Based on a Parametric Kernel Function. CSO (2) 2009: 748-752 - 2005
- [j5]Guo-Qiang Wang, Yan-Qin Bai, Cornelis Roos:
Primal-Dual Interior-Point Algorithms for Semidefinite Optimization Based on a Simple Kernel Function. J. Math. Model. Algorithms 4(4): 409-433 (2005) - 2004
- [j4]Yan-Qin Bai, Mohamed El Ghami
A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization. SIAM J. Optim. 15(1): 101-128 (2004) - 2003
- [j3]Yan-Qin Bai, Cornelis Roos:
A polynomial-time algorithm for linear optimization based on a new simple kernel function. Optim. Methods Softw. 18(6): 631-646 (2003) - 2002
- [j2]Yan-Qin Bai, Cees Roos, Mohamed El Ghami
A primal-dual interior-point method for linear optimization based on a new proximity function. Optim. Methods Softw. 17(6): 985-1008 (2002) - [j1]Yan-Qin Bai, Mohamed El Ghami
A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier. SIAM J. Optim. 13(3): 766-782 (2002)
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-10-07 22:10 CEST 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: