Jin Zhang

Orcid: 0000-0002-6691-5612

Affiliations:
  • Southern University of Science and Technology, Department of Mathematics, Shenzhen, China
  • Hong Kong Baptist University, Department of Mathematics, Hong Kong (former)
  • University of Victoria, Department of Mathematics and Statistics, BC, Canada (PhD 2014)
  • Dalian University of Technology, School of Mathematical Sciences, China (former)


According to our database1, Jin Zhang authored at least 53 papers between 2011 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Memristor-induced hyperchaos, multiscroll and extreme multistability in fractional-order HNN: Image encryption and FPGA implementation.
Neural Networks, 2024

Sensitivity Analysis of the Maximal Value Function with Applications in Nonconvex Minimax Programs.
Math. Oper. Res., 2024

Moreau Envelope for Nonconvex Bi-Level Optimization: A Single-Loop and Hessian-Free Solution Strategy.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023
Second-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive Systems.
SIAM J. Optim., December, 2023

Value-Function-Based Sequential Minimization for Bi-Level Optimization.
IEEE Trans. Pattern Anal. Mach. Intell., December, 2023

Hierarchical Optimization-Derived Learning.
IEEE Trans. Pattern Anal. Mach. Intell., December, 2023

A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems.
Comput. Optim. Appl., November, 2023

Density-Based Distance Preserving Graph: Theoretical and Practical Analyses.
IEEE Trans. Neural Networks Learn. Syst., September, 2023

Second-Order Enhanced Optimality Conditions and Constraint Qualifications.
J. Optim. Theory Appl., September, 2023

Difference of convex algorithms for bilevel programs with applications in hyperparameter selection.
Math. Program., April, 2023

A globally convergent proximal Newton-type method in nonsmooth convex optimization.
Math. Program., March, 2023

MSTA-SlowFast: A Student Behavior Detector for Classroom Environments.
Sensors, 2023

A General Descent Aggregation Framework for Gradient-Based Bi-Level Optimization.
IEEE Trans. Pattern Anal. Mach. Intell., 2023

Moreau Envelope Based Difference-of-weakly-Convex Reformulation and Algorithm for Bilevel Programs.
CoRR, 2023

Averaged Method of Multipliers for Bi-Level Optimization without Lower-Level Strong Convexity.
Proceedings of the International Conference on Machine Learning, 2023

2022
Stochastic Approximation Methods for the Two-Stage Stochastic Linear Complementarity Problem.
SIAM J. Optim., September, 2022

Task-Oriented Convex Bilevel Optimization With Latent Feasibility.
IEEE Trans. Image Process., 2022

Generic Property of the Partial Calmness Condition for Bilevel Programming Problems.
SIAM J. Optim., 2022

Investigating Bi-Level Optimization for Learning and Vision From a Unified Perspective: A Survey and Beyond.
IEEE Trans. Pattern Anal. Mach. Intell., 2022

Linear Convergence of Prox-SVRG Method for Separable Non-smooth Convex Optimization Problems under Bounded Metric Subregularity.
J. Optim. Theory Appl., 2022

Towards Extremely Fast Bilevel Optimization with Self-governed Convergence Guarantees.
CoRR, 2022

Optimization-Derived Learning with Essential Convergence Analysis of Training and Hyper-training.
Proceedings of the International Conference on Machine Learning, 2022

Value Function based Difference-of-Convex Algorithm for Bilevel Hyperparameter Selection Problems.
Proceedings of the International Conference on Machine Learning, 2022

2021
Investigating Customization Strategies and Convergence Behaviors of Task-Specific ADMM.
IEEE Trans. Image Process., 2021

Variance-Based Subgradient Extragradient Method for Stochastic Variational Inequality Problems.
J. Sci. Comput., 2021

Personality information sharing in supply chain systems for innovative products in the circular economy era.
Int. J. Prod. Res., 2021

A Generic Descent Aggregation Framework for Gradient-based Bi-level Optimization.
CoRR, 2021

Towards Gradient-based Bilevel Optimization with Non-convex Followers and Beyond.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

A Value-Function-based Interior-point Method for Non-convex Bi-level Optimization.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Discerning the Linear Convergence of ADMM for Structured Convex Optimization through the Lens of Variational Analysis.
J. Mach. Learn. Res., 2020

A Generic First-Order Algorithmic Framework for Bi-Level Programming Beyond Lower-Level Singleton.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Exact Formula for the Second-Order Tangent Set of the Second-Order Cone Complementarity Set.
SIAM J. Optim., 2019

Directional Quasi-/Pseudo-Normality as Sufficient Conditions for Metric Subregularity.
SIAM J. Optim., 2019

Mathematical Programs with Second-Order Cone Complementarity Constraints: Strong Stationarity and Approximation Method.
J. Optim. Theory Appl., 2019

Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications.
J. Comput. Appl. Math., 2019

On the Convergence of ADMM with Task Adaption and Beyond.
CoRR, 2019

Bilevel Integrative Optimization for Ill-posed Inverse Problems.
CoRR, 2019

New Constraint Qualifications for S-Stationarity for MPEC with Nonsmooth Objective.
Asia Pac. J. Oper. Res., 2019

2018
Partial Error Bound Conditions and the Linear Convergence Rate of the Alternating Direction Method of Multipliers.
SIAM J. Numer. Anal., 2018

Constraint Qualifications and Proper Pareto Optimality Conditions for Multiobjective Problems with Equilibrium Constraints.
J. Optim. Theory Appl., 2018

Smoothing partial exact penalty splitting method for mathematical programs with equilibrium constraints.
J. Glob. Optim., 2018

Expected residual minimization formulation for a class of stochastic linear second-order cone complementarity problems.
Eur. J. Oper. Res., 2018

Distributionally robust equilibrium for continuous games: Nash and Stackelberg models.
Eur. J. Oper. Res., 2018

2017
Primal-dual hybrid gradient method for distributionally robust optimization problems.
Oper. Res. Lett., 2017

Stochastic second-order-cone complementarity problems: expected residual minimization formulation and its applications.
Math. Program., 2017

Expected Residual Minimization Formulation for a Class of Stochastic Vector Variational Inequalities.
J. Optim. Theory Appl., 2017

2016
Smoothing and SAA method for stochastic programming problems with non-smooth objective and constraints.
J. Glob. Optim., 2016

2014
Sensitivity Analysis of the Value Function for Parametric Mathematical Programs with Equilibrium Constraints.
SIAM J. Optim., 2014

Enhanced Karush-Kuhn-Tucker Conditions for Mathematical Programs with Equilibrium Constraints.
J. Optim. Theory Appl., 2014

New Results on Constraint Qualifications for Nonlinear Extremum Problems and Extensions.
J. Optim. Theory Appl., 2014

2013
Mathematical Programs with Geometric Constraints in Banach Spaces: Enhanced Optimality, Exact Penalty, and Sensitivity.
SIAM J. Optim., 2013

Enhanced Karush-Kuhn-Tucker condition and weaker constraint qualifications.
Math. Program., 2013

2011
Stochastic mathematical programs with hybrid equilibrium constraints.
J. Comput. Appl. Math., 2011


  Loading...