Chengjing Wang

Orcid: 0000-0001-8959-2505

According to our database1, Chengjing Wang authored at least 21 papers between 2006 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Perturbation analysis of a class of composite optimization problems.
CoRR, 2024

2023
A Dual Semismooth Newton Based Augmented Lagrangian Method for Large-Scale Linearly Constrained Sparse Group Square-Root Lasso Problems.
J. Sci. Comput., August, 2023

A Proximal-Proximal Majorization-Minimization Algorithm for Nonconvex Rank Regression Problems.
IEEE Trans. Signal Process., 2023

An inexact proximal majorization-minimization Algorithm for remote sensing image stripe noise removal.
CoRR, 2023

Learning the hub graphical Lasso model with the structured sparsity via an efficient algorithm.
CoRR, 2023

An Efficient Byzantine Fault-Tolerant Consensus Mechanism Based on Aggregate Threshold Ring Signature.
Proceedings of the 8th International Conference on Computer and Communication Systems, 2023

2022
An Efficient Algorithm for a Class of Large-Scale Support Vector Machines Exploiting Hidden Sparsity.
IEEE Trans. Signal Process., 2022

An efficient algorithm for the 𝓁<sub>p</sub> norm based metric nearness problem.
CoRR, 2022

2021
A dual symmetric Gauss-Seidel alternating direction method of multipliers for hyperspectral sparse unmixing.
Numer. Algorithms, 2021

A proximal-proximal majorization-minimization algorithm for nonconvex tuning-free robust regression problems.
CoRR, 2021

2020
An Inexact Dual Alternating Direction Method of Multipliers for Image Decomposition and Restoration.
Asia Pac. J. Oper. Res., 2020

2019
A sparse semismooth Newton based augmented Lagrangian method for large-scale support vector machines.
CoRR, 2019

A sparse semismooth Newton based proximal majorization-minimization algorithm for nonconvex square-root-loss regression problems.
CoRR, 2019

2017
A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming.
Comput. Optim. Appl., 2017

2016
A majorized Newton-CG augmented Lagrangian-based finite element method for 3D restoration of geological models.
Comput. Geosci., 2016

On how to solve large-scale log-determinant optimization problems.
Comput. Optim. Appl., 2016

2013
An Inexact Accelerated Proximal Gradient Method and a Dual Newton-CG Method for the Maximal Entropy Problem.
J. Optim. Theory Appl., 2013

2010
Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm.
SIAM J. Optim., 2010

Some extensions of Faà di Bruno's formula with divided differences.
Comput. Math. Appl., 2010

2006
Some remarks on conjugate gradient methods without line search.
Appl. Math. Comput., 2006

Dogleg paths and trust region methods with back tracking technique for unconstrained optimization.
Appl. Math. Comput., 2006


  Loading...