Yanqin Bai
Orcid: 0000-0002-6038-0805
According to our database1,
Yanqin Bai
authored at least 44 papers
between 2002 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
A non-convex piecewise quadratic approximation of ℓ <sub>0</sub> regularization: theory and accelerated algorithm.
J. Glob. Optim., June, 2023
Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection.
Optim. Methods Softw., March, 2023
Int. J. Mach. Learn. Cybern., 2023
2022
Two-dimensional Bhattacharyya bound linear discriminant analysis with its applications.
Appl. Intell., 2022
2021
A sparse optimization problem with hybrid L<sub>2</sub> -L<sub>p</sub> regularization for application of magnetic resonance brain images.
J. Comb. Optim., 2021
Reverse nearest neighbors Bhattacharyya bound linear discriminant analysis for multimodal classification.
Eng. Appl. Artif. Intell., 2021
Proceedings of the 13th International Conference on Agents and Artificial Intelligence, 2021
2019
Portfolio selection with the effect of systematic risk diversification: formulation and accelerated gradient algorithm.
Optim. Methods Softw., 2019
An Adaptive Infeasible-Interior-Point Method with the One-Norm Wide Neighborhood for Semi-definite Programming.
J. Sci. Comput., 2019
An inexact splitting method for the subspace segmentation from incomplete and noisy observations.
J. Glob. Optim., 2019
J. Comb. Optim., 2019
Autom., 2019
2018
A proximal quadratic surface support vector machine for semi-supervised binary classification.
Soft Comput., 2018
A P-ADMM for sparse quadratic kernel-free least squares semi-supervised support vector machine.
Neurocomputing, 2018
Int. J. Neural Syst., 2018
2016
Global Optimization for Solving Linear Multiplicative Programming Based on a New Linearization Method.
Sci. Program., 2016
Optimal trade-off portfolio selection between total risk and maximum relative marginal risk.
Optim. Methods Softw., 2016
Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables.
Optim. Methods Softw., 2016
J. Optim. Theory Appl., 2016
J. Oper. Res. Soc., 2016
Analysis of Entropy Generation in the Flow of Peristaltic Nanofluids in Channels With Compliant Walls.
Entropy, 2016
2015
Improved Complexity Analysis of Full Nesterov-Todd Step Interior-Point Methods for Semidefinite Optimization.
J. Optim. Theory Appl., 2015
Quadratic kernel-free least squares support vector machine for target diseases classification.
J. Comb. Optim., 2015
A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization.
J. Comput. Appl. Math., 2015
2013
A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function.
Optim. Methods Softw., 2013
Optim. Lett., 2013
2012
A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function.
Numer. Algorithms, 2012
A New Full Nesterov-Todd Step Primal-Dual Path-Following Interior-Point Algorithm for Symmetric Optimization.
J. Optim. Theory Appl., 2012
A Class of Polynomial Interior Point Algorithms for the Cartesian P-Matrix Linear Complementarity Problem over Symmetric Cones.
J. Optim. Theory Appl., 2012
2010
A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization.
RAIRO Oper. Res., 2010
2009
RAIRO Oper. Res., 2009
Polynomial interior-point algorithms for P<sub>*</sub>(k) horizontal linear complementarity problem.
J. Comput. Appl. Math., 2009
A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step.
Appl. Math. Comput., 2009
A Primal-Dual Interior-Point Algorithm for Convex Quadratic Optimization Based on a Parametric Kernel Function.
Proceedings of the Second International Joint Conference on Computational Sciences and Optimization, 2009
2005
Primal-Dual Interior-Point Algorithms for Semidefinite Optimization Based on a Simple Kernel Function.
J. Math. Model. Algorithms, 2005
2004
A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization.
SIAM J. Optim., 2004
2003
A polynomial-time algorithm for linear optimization based on a new simple kernel function.
Optim. Methods Softw., 2003
2002
A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier.
SIAM J. Optim., 2002
A primal-dual interior-point method for linear optimization based on a new proximity function.
Optim. Methods Softw., 2002