Yongli Wang

ORCID: 0000-0001-8221-451X
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Advanced Optimization Algorithms Research
  • Advanced Algorithms and Applications
  • Robotic Mechanisms and Dynamics
  • Advanced Sensor and Control Systems
  • Sparse and Compressive Sensing Techniques
  • Matrix Theory and Algorithms
  • Soft Robotics and Applications
  • Optimization and Variational Analysis
  • Industrial Technology and Control Systems
  • Mathematical functions and polynomials
  • Robot Manipulation and Learning
  • Engineering Education and Curriculum Development
  • Mathematical Inequalities and Applications
  • Image and Signal Denoising Methods
  • Embedded Systems and FPGA Design
  • Advanced Control Systems Optimization
  • Simulation and Modeling Applications
  • Remote-Sensing Image Classification
  • Metaheuristic Optimization Algorithms Research
  • Advanced Measurement and Metrology Techniques
  • Advanced Computational Techniques and Applications
  • Elevator Systems and Control
  • Blind Source Separation Techniques
  • Piezoelectric Actuators and Control
  • Stability and Control of Uncertain Systems

China National Petroleum Corporation (China)
2024

Inner Mongolia Electric Power (China)
2024

Huzhou University
2021-2023

Nanjing University of Science and Technology
2023

Shandong University of Science and Technology
2005-2022

Yanshan University
2016-2020

Jilin Vocational College of Industry and Technology
2019

Naval University of Engineering
2018

North China Electric Power University
2017

Civil Aviation Administration of China
2013

Hyperspectral image (HSI) denoising is challenging not only because of the difficulty in preserving both spectral and spatial structures simultaneously, but also due to requirement removing various noises, which are often mixed together. In this paper, we present a nonconvex low rank matrix approximation (NonLRMA) model corresponding HSI method by reformulating problem using regularizer instead traditional nuclear norm, resulting tighter original sparsity-regularised function. NonLRMA aims...

10.1109/tgrs.2017.2706326 article EN IEEE Transactions on Geoscience and Remote Sensing 2017-06-27

Distributed computation over networks is now receiving an increasing attention in many fields such as engineering and machine learning, where the solution of a linear system equations basic task. This paper presents asynchronous distributed randomized block Kaczmarz projection algorithm for solving large-scale systems multi-agent networks, each agent only holds part problem data. An event-triggered communication mechanism integrated to minimize overhead reduce overall costs. allows update...

10.48550/arxiv.2502.14213 preprint EN arXiv (Cornell University) 2025-02-19

Restoration of hyperspectral images (HSIs) is a challenging task, owing to the reason that are inevitably contaminated by mixture noise, including Gaussian impulse dead lines, and stripes, during their acquisition process. Recently, HSI denoising approaches based on low-rank matrix approximation have become an active research field in remote sensing achieved state-of-the-art performance. These approaches, however, unavoidably require calculate full or partial singular value decomposition...

10.1109/lgrs.2017.2700406 article EN IEEE Geoscience and Remote Sensing Letters 2017-05-19

Reconstruction of highly accelerated dynamic magnetic resonance imaging (MRI) is crucial importance for the medical diagnosis. The application general robust principal component analysis (RPCA) to MRI can increase speed and efficiency. However, conventional RPCA makes use nuclear norm as convex surrogate rank function, whose drawbacks have been mentioned in plenty literature. Recently, nonconvex surrogates function widely investigated proved be tighter approximation than by massive...

10.1109/access.2017.2657645 article EN cc-by-nc-nd IEEE Access 2017-01-01

Background/foreground separation has become an inevitable step in numerous image/video processing applications, such as inpainting, anomaly detection, motion segmentation, augmented reality, and so on. Recent low-rank based approaches, robust principal component analysis separating a data matrix into with sparse matrix, have achieved encouraging performance. However, these approaches usually need relatively high computation cost, mainly due to calculation of full or partial singular value...

10.1109/access.2018.2818322 article EN cc-by-nc-nd IEEE Access 2018-01-01

Recently, robust principal component analysis (RPCA) has been widely used in the detection of moving objects. However, this method fails to effectively utilize low-rank prior information background and spatiotemporal continuity object, target extraction effect is often poor when dealing with large-scale complex scenes. To solve above problems, a new non-convex rank approximate RPCA model based on segmentation constraint proposed. Firstly, adopts sparse decomposition divide original video...

10.1109/access.2020.2977273 article EN cc-by IEEE Access 2020-01-01

We propose a monotone descent active set QP-free method for inequality constrained optimization that ensures the feasibility of all iterates and allows on boundary feasible set. The study is motivated by Facchinei--Fischer--Kanzow identification technique nonlinear programming variational inequalities [F. Facchinei, A. Fischer, C. Kanzow, SIAM J. Optim., 9 (1999), pp. 14-32]. Distinguishing features proposed compared with existing methods include lower subproblem costs fast convergence rate...

10.1137/040605904 article EN SIAM Journal on Optimization 2006-01-01

The generalized trigonometric functions which have a short history, were introduced by Lindqvist two decades ago.Since 2012, many mathematician began to study their classical inequalities, general convexity and concavity, multiple-angle formulas parameter concavity.A number of results been obtained.This is survey.Some new refinements, generalizations, applications, related problems are summarized.

10.7153/jmi-2019-13-58 article EN Journal of Mathematical Inequalities 2019-01-01

10.1016/j.amc.2010.12.005 article EN Applied Mathematics and Computation 2010-12-16

In this paper, we establish a concave theorem and some inequalities for the generalized digamma function. Hence, give complete monotonicity property of determinant function involving all kinds derivatives

10.1186/s13662-018-1695-7 article EN cc-by Advances in Difference Equations 2018-07-20

10.1016/j.camwa.2009.03.085 article EN publisher-specific-oa Computers & Mathematics with Applications 2009-04-23

Traditional robust principal component analysis (RPCA) is very prone to voids in the process of background/foreground separation complex scene videos and easy misjudge dynamic background as a moving target, which makes effect unideal.In order address this problem, article introduces super-pixel segmentation technique into RPCA model.First, Linear Spectral Clustering algorithm (LSC) used mark video sequence grouping matrix obtained.Then new model proposed based on non-convex rank...

10.1109/access.2020.3018705 article EN cc-by IEEE Access 2020-01-01

In this paper, we show an elegant inequality involving the ratio of generalized complete elliptic integrals first kind and generalize interesting result Alzer.

10.1186/s13660-017-1578-6 article EN cc-by Journal of Inequalities and Applications 2017-12-01

SUMMARY A three-dimensional (3D) model of a novel 5-DoF type parallel manipulator with couple-constrained wrench is constructed and its analyzed. First, the formulas are derived for solving displacement, velocity, acceleration moving platform links, workspace constructed. Second, inertial wrenches links. Third, dynamics equation established by considering friction, dynamically active forces wrench. Finally, numerical example given to demonstrate analytic solution kinematics dynamics,...

10.1017/s0263574718000474 article EN Robotica 2018-06-22

The authors obtain some Wilker and Cusa type inequalities for generalized trigonometric hyperbolic functions generalize known inequalities.

10.1186/s13660-018-1644-8 article EN cc-by Journal of Inequalities and Applications 2018-03-02

This article introduces a smoothing technique to the l1 exact penalty function. An application of yields twice continuously differentiable function and smoothed problem. Under some mild conditions, optimal solution problem becomes an approximate original constrained optimization Based on problem, we propose algorithm solve Every limit point sequence generated by is solution. Several numerical examples are presented illustrate performance proposed algorithm.

10.1080/01630563.2018.1483948 article EN Numerical Functional Analysis and Optimization 2018-12-27
Coming Soon ...