Research Library

The literature behind our research

Recent Q1–Q2 journal articles connected to DeepMathAI's research, with a short summary of each and links to the publisher and to free versions.

209 articles24 topics174 in Q1 journals81 open access

Popular searches:

209 of 209 articlesUpdated 16 November 2026 · new articles added weekly

Neurodynamic Optimization

71 articles

Recurrent and gradient neural networks whose dynamics solve optimization, equilibrium and matrix-equation problems — with fixed- and predefined-time convergence, distributed and collaborative variants, and applications to machine-learning models.

Gradient neural networks11

Primal–dual neural networks5

Projection neural networks9

Fixed- and predefined-time convergence6

Distributed and multi-agent optimization7

Complementarity and merit functions10

Neurodynamics for machine-learning models17

Collaborative neurodynamic optimization in machine learning

Sparse recovery and low-rank problems

Inertial dynamics and ODE methods6

Second-order and circular cones6

Absolute value equations9

  • New2026
    A globally convergent hybrid-adaptive accelerated Douglas–Rachford splitting method for absolute value equations

    Pengjie Liu, Linhao Li, Peng Huang et al.

    From the abstract

    In this paper, we propose a hybrid-adaptive accelerated Douglas–Rachford splitting method (HAA-DRSM) for solving absolute value equations of the form Ex−|x|−p=0.

    OptimizationQ1DOI
  • New2026
    A new class of stochastic absolute value equations

    Jingyong Tang, Rongge Chen

    From the abstract

    This paper investigates a new class of stochastic absolute value equations (SAVE), which is equivalent to the stochastic vertical linear complementarity problem. Due to the existence of random variables, the SAVE may not have a common solution for almost every realization.

    Optimization LettersQ2DOI
  • New2026
    More on the properties of solution set of absolute value equations

    Shweta Yadav, Dipti Dubey

    Read the abstract on the publisher's site
    Optimization LettersQ2DOI
  • New2026
    On the Kaczmarz method with maximal residual rule for system of absolute value equations

    Jiayi Wang, Fang Chen

    Overview

    Studies a Kaczmarz-type iterative method with a maximal-residual selection rule for solving systems of absolute value equations.

    Journal of Computational and Applied MathematicsQ1DOI
  • 2025
    Absolute value equations with 2ⁿ solutions

    Milan Hladík

    From the abstract

    An absolute value equation system is an algebraic problem that involves solving the n-by-n system Ax+|x|=b . This problem is known to be NP-hard, and its solution set can have a complicated structure. So far, the research has primarily focused on the unique solvability cases.

    Optimization LettersQ2 Open accessDOI
  • 2025
    Absolute value equations with interval uncertainty

    Milan Hladík, Lenka Ptáčková

    From the abstract

    We consider the (generalized) absolute value equations with uncertain entries. In particular, we assume that the entries come from given intervals. For such interval-valued problem, we study the fundamental properties regarding solutions and solvability.

    Soft ComputingQ2DOI
  • 2025
    An application of generalized absolute value equation

    Cui-Xia Li, Shi-Liang Wu

    From the abstract

    In this paper, an application of the generalized absolute value equation is exploited. Concretely, by using the generalized absolute value equation, we provide a new approach to efficiently obtain the hull of the solution set to interval linear equations with certain inverse positive coefficient interval matrix.

    Journal of Nonlinear Mathematical PhysicsQ2 Open accessDOI
  • 2025
    Fractional absolute value equations

    Francesco Mezzadri

    From the abstract

    We introduce the fractional absolute value equation (FAVE), which is an absolute value equation containing fractional terms of the unknown variables. For simplicity, we first consider a simple 1-dimensional FAVE and then generalize the results to problems of arbitrary dimension n.

    Optimization LettersQ2 Open accessDOI
  • 2025
    Sparse Solutions to Tensor Absolute Value Equations

    Shouqiang Du, Jingjing Sun, Yimin Wei

    From the abstract

    Sparse optimization problems have drawn wide attention in recent years, which have been extensively applied to compressed sensing, signal and image processings. As a kind of important optimization problem, absolute value equations have been extensively studied.

    Journal of the Operations Research Society of ChinaQ2DOI

Smoothing and nonsmooth optimization11

Multiobjective optimization6

Semidefinite programming5

Convex analysis and optimality conditions5

Machine Learning

51 articles

Support vector machines and twin SVMs with robust losses, multi-view learning, random vector functional link networks, and the optimization methods used to train machine-learning and deep-learning models.

SVMs, twin SVMs and loss functions5

  • 2026
    Functional data classification using twin support vector machines

    Reshma Rastogi, Muskan Singhal

    From the abstract

    Conventional machine learning algorithms are primarily designed for vector-based data and hence often fail to exploit the inherent continuity and smoothness that characterize functional data.

    OPSEARCHQ2DOI
  • 2026
    Quadratic surface twin support vector machine for imbalanced data

    Hossein Moosaei, Milan Hladík, Ahmad Mousavi et al.

    TL;DR

    A novel approach to tackle binary classification tasks with imbalanced classes by leveraging Universum points to support the minority class within quadratic twin support vector machine models, demonstrating superior performance compared to conventional classifiers and existing methods for imbalanced classification.

    International Journal of Machine Learning and CyberneticsQ2 Open accessDOI
  • 2025
    Granular ball twin support vector machine with Universum data

    M.A. Ganaie, Vrushank Ahire

    TL;DR

    The Granular Ball Twin Support Vector Machine with Universum Data (GBU-TSVM) is proposed, which uniquely integrates Universum samples with granular ball computing in the TSVM framework, significantly improving robustness against noise while enhancing computational efficiency.

    Neural NetworksQ1 Open accessarXiv DOI
  • 2024
    Kreĭn twin support vector machines for imbalanced data classification

    Cristian Alfonso Jimenez-Castaño, Andrés Marino Álvarez-Meza, David Augusto Cardenas Peña et al.

    Overview

    Extends twin support vector machines to Kreĭn spaces, which accommodate indefinite kernels, to classify imbalanced data.

    Pattern Recognition LettersQ1 Open accessDOI
  • 2024
    Multi-task twin support vector machine with Universum data

    Hossein Moosaei, Fatemeh Bazikar, Milan Hladík

    From the abstract

    Multi-task learning (MTL) has emerged as a promising topic of machine learning in recent years, aiming to enhance the performance of numerous related learning tasks by exploiting beneficial information.

    Engineering Applications of Artificial IntelligenceQ1 Open accessarXiv DOI

Multi-view learning11

Random vector functional link and ensembles5

Optimization for machine learning30

Bilevel optimization and hyperparameter selection

  • 2026
    On the Communication Complexity of Decentralized Stochastic Bilevel Optimization

    Yihan Zhang, My T. Thai, Jie Wu et al.

    TL;DR

    This work proposes two novel decentralized stochastic bilevel gradient descent algorithms based on simultaneous and alternating update strategies that can achieve faster convergence rates and lower communication costs than existing methods.

    Machine LearningQ1 Open accessDOI
  • 2025
    Decentralized bilevel optimization

    Xuxing Chen, Minhui Huang, Shiqian Ma

    TL;DR

    This paper designs decentralized algorithms for both deterministic and stochastic bilevel optimization problems and analyzes the convergence rates of the proposed algorithms in difference scenarios including the case where data heterogeneity is observed across agents.

    Optimization LettersQ2 Open accessarXiv DOI
  • 2025
    On the Convergence of Proximal Gradient Methods for Convex Simple Bilevel Optimization

    Puya Latafat, Andreas Themelis, Silvia Villa et al.

    TL;DR

    An adaptive linesearch method is developed that introduces a systematic adaptive scheme enabling large and nonmonotonic stepsize sequences while being insensitive to the choice of hyperparameters and initialization.

    Journal of Optimization Theory and ApplicationsQ1 Open accessFree version DOI
  • 2025
    Unified smoothing approach for best hyperparameter selection problem using a bilevel optimization strategy

    Jan Harold Alcantara, Chieu Thanh Nguyen, Takayuki Okuno et al.

    TL;DR

    This work proposes new bilevel KKT conditions, which are new necessary optimality conditions tighter than the ones proposed by Okuno et al, and proposes a unified smoothing approach using smoothing functions that belong to the Chen-Mangasarian class.

    Mathematical ProgrammingQ1 Open accessarXiv DOI
  • 2024
    A safe screening rule with bi-level optimization of ν support vector machine

    Zhiji Yang, Wanyi Chen, Huan Zhang et al.

    From the abstract

    Support vector machine (SVM) has achieved many successes in machine learning, especially for a small sample problem. As a famous extension of the traditional SVM, the ν support vector machine (ν-SVM) has shown outstanding performance due to its great model interpretability.

    Pattern RecognitionQ1 Open accessDOI
  • 2024
    Gradient-based algorithms for multi-objective bi-level optimization

    Xinmin Yang, Wei Yao, Haian Yin et al.

    TL;DR

    This work proposes a gradient-based algorithm for MOBLO, called gMOBA, which has fewer hyperparameters to tune, making it both simple and efficient and demonstrates the theoretical validity by accomplishing the desirable Pareto stationarity.

    Science China MathematicsQ1 Open accessarXiv DOI

Deep learning for solving optimization problems (AVE, VI)

Dynamical systems and gradient flows of deep-learning training

Minimax, saddle points and variational inequalities in adversarial learning

Multiobjective optimization in deep learning

Nonsmooth and smoothing methods for training neural networks

SOCP and SDP for SVMs, feature selection and clustering

Generative Models & Inverse Problems

33 articles

GANs and diffusion models for medical imaging, image restoration and deblurring, and stochastic optimization for PET reconstruction.

Generative adversarial networks7

Diffusion models6

Image restoration11

PET reconstruction and stochastic optimization9

Spine and vertebral fractures5

Osteoporosis7

Curated by the DeepMathAI Research Group from Scopus Q1–Q2 journals (quartiles from SJR); every week, recent articles on each topic from the same journals are added automatically and marked New. Bibliographic data and open-access links from OpenAlex. Summaries are an AI-generated TL;DR from Semantic Scholar, the opening sentences of the article's abstract, or a short overview written for this site from the article's title where no abstract is freely available. Links lead to the publishers and to open repositories such as arXiv; this site does not host the articles, and some publisher pages require a subscription.