Optimisation by predefined upper bound of settling time convergent projected gradient flows

Authors

Thach Ngoc Dinh (ORCID: https://orcid.org/0000-0001-8827-0993)
Parijat Prasun (ORCID: https://orcid.org/0009-0006-5410-9361)
Sunidhi Pandey (ORCID: https://orcid.org/0009-0004-7834-8549)
Devender Singh (ORCID: https://orcid.org/0000-0002-1430-9653)
Shyam Kamal

Institutions

Conservatoire National des Arts et Métiers (FR)
Indian Institute of Technology BHU (IN)

Publication Details

Journal: International Journal of Systems Science
Published: 2025-09-24
DOI: https://doi.org/10.1080/00207721.2025.2552274
Primary Topic: Optimization and Variational Analysis
Type: article
Field-Weighted Citation Impact: 0.00

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

Optimisation by predefined upper bound of settling time convergent projected gradient flows

Thach Ngoc Dinh, Parijat Prasun, Sunidhi Pandey, Devender Singh et al.

Sep 24, 2025

International Journal of Systems Science

Optimization and Variational Analysis

article

Optimisation by predefined upper bound of settling time convergent projected gradient flows

Thach Ngoc Dinh, Parijat Prasun, Sunidhi Pandey, Devender Singh, Shyam Kamal

September 24, 2025article en

Abstract

No abstract available for this paper.

International Journal of Systems Science

Conservatoire National des Arts et Métiers (FR), Indian Institute of Technology BHU (IN)

Openalex Percentile: Top 72%

Optimization and Variational Analysis

DOI Source OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.