Yi-Shuai Niu

Orcid: 0000-0002-9993-3681

Affiliations:
  • National Institute of Applied Sciences, Rouen, France


According to our database1, Yi-Shuai Niu authored at least 21 papers between 2008 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Boosted-DCA with Power-Sum-DC Decomposition for Linearly Constrained Polynomial Programs.
J. Optim. Theory Appl., May, 2024

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials.
SIAM J. Optim., 2024

2023
Accelerated DC Algorithms for the Asymmetric Eigenvalue Complementarity Problem.
CoRR, 2023

An Accelerated DC Programming Approach with Exact Line Search for The Symmetric Eigenvalue Complementarity Problem.
CoRR, 2023

2022
Discrete Dynamical System Approaches for Boolean Polynomial Optimization.
J. Sci. Comput., 2022

On the convergence analysis of DCA.
CoRR, 2022

2021
A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model.
Optim. Lett., 2021

A Refined Inertial DCA for DC Programming.
CoRR, 2021

Spatio-Temporal Neural Network for Fitting and Forecasting COVID-19.
CoRR, 2021

A Difference-of-Convex Cutting Plane Algorithm for Mixed-Binary Linear Program.
CoRR, 2021

2020
A Difference-of-Convex Programming Approach With Parallel Branch-and-Bound For Sentence Compression Via A Hybrid Extractive Model.
CoRR, 2020

2019
Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem.
Appl. Math. Comput., 2019

Parallel DC Cutting Plane Algorithms for Mixed Binary Linear Program.
Proceedings of the Optimization of Complex Systems: Theory, 2019

Sentence Compression via DC Programming Approach.
Proceedings of the Optimization of Complex Systems: Theory, 2019

2016
DC programming approaches for discrete portfolio optimization under concave transaction costs.
Optim. Lett., 2016

2015
Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming.
Proceedings of the Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, 2015

2014
DC Programming Approaches for BMI and QMI Feasibility Problems.
Proceedings of the Advanced Computational Methods for Knowledge Engineering, 2014

2013
Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem.
Optim. Methods Softw., 2013

2012
DC Programming and DCA for Large-Scale Two-Dimensional Packing Problems.
Proceedings of the Intelligent Information and Database Systems - 4th Asian Conference, 2012

2011
An efficient DC programming approach for portfolio decision with higher moments.
Comput. Optim. Appl., 2011

2008
A DC Programming Approach for Mixed-Integer Linear Programs.
Proceedings of the Modelling, 2008


  Loading...