Cover Image

An Adaptive Order Caputo Fractional Gradient Descent Method for Multi-objective Optimization Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shaw, Barsha, Ansary, Md Abu Talhamainuddin
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 26A33, 90C29, 90C25, 65K99, 49M05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Conjugate Gradient Method for Nonlinear Programming Problems using Caputo Fractional Gradients
by: Shawa, Barsha, et al.
Published: (2025)

Global Descent Method for Non-convex Multi-objective Optimization Problems
by: Adhikary, Bikram, et al.
Published: (2025)

A Tunneling Method for Nonlinear Multi-objective Optimization Problems
by: Adhikary, Bikram, et al.
Published: (2024)

A Trust Region Proximal Gradient Method for Nonlinear Multi-objective Optimization Problems
by: Ansary, Md Abu Talhamainuddin
Published: (2024)

One-parameter Filled Function Method for Non-convex Multi-objective Optimization Problems
by: Adhikary, Bikram, et al.
Published: (2026)

Identification of Active Subfunctions in Finite-Max Minimisation via a Smooth Reformulation
by: Ras, Charl, et al.
Published: (2024)

Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
by: Saadati, Maryam, et al.
Published: (2022)

Optimization landscape of $\ell_0$-Bregman relaxations
by: Chirinos-Rodríguez, Jonathan, et al.
Published: (2025)

A Cubic Regularization Method for Multiobjective Optimization
by: Gonçalves, Douglas S., et al.
Published: (2025)

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
by: Yuan, Ya-xiang, et al.
Published: (2024)

Optimization Problems with Nearly Convex Objective Functions and Nearly Convex Constraint Sets
by: Thieu, Nguyen Nang, et al.
Published: (2026)

New Classes of Non-monotone Variational Inequality Problems Solvable via Proximal Gradient on Smooth Gap Functions
by: Zhao, Lei, et al.
Published: (2025)

A Unified Analysis on the Subgradient Upper Bounds for the Subgradient Methods Minimizing Composite Nonconvex, Nonsmooth and Non-Lipschitz Functions
by: Zhu, Daoli, et al.
Published: (2023)

Second-Order Optimality Conditions for Sparse Differentiable Optimization Problems via Limiting Second-Order Subdifferentials
by: Huyen, Luu Thi Thu, et al.
Published: (2026)

The Influence of an Adjoint Mismatch on the Primal-Dual Douglas-Rachford Method
by: Naldi, Emanuele, et al.
Published: (2025)

Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
by: Ou, Hongjia, et al.
Published: (2025)

A New Linear Programming Approach and a New Backtracking Strategy for Multiple-Gradient Descent in Multi-Objective Optimization
by: Della Santa, Francesco
Published: (2024)

On circumcentered direct methods for monotone variational inequality problems
by: Behling, Roger, et al.
Published: (2025)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

Parallel Polyhedral Projection Method for the Convex Feasibility Problem
by: Barros, Pablo, et al.
Published: (2025)

A full splitting algorithm for structured difference-of-convex programs
by: Bot, Radu Ioan, et al.
Published: (2025)

First and Second Order Necessary and Sufficient Optimality Conditions of Fritz John Type for Vector Problems over Cones
by: Ivanov, Vsevolod I.
Published: (2024)

On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation
by: Bollapragada, Raghu, et al.
Published: (2025)

Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization
by: Li, Hanyang, et al.
Published: (2025)

Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
by: Jin, Ruinan, et al.
Published: (2026)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
by: Xie, Xiyuan, et al.
Published: (2025)

A linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions
by: Karmarkar, Tanmaya, et al.
Published: (2025)

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
by: Kabgani, Alireza, et al.
Published: (2024)

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
by: Kabgani, Alireza, et al.
Published: (2025)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
by: Bot, Radu Ioan, et al.
Published: (2024)

A Proximal Stochastic Gradient Method with Adaptive Step Size and Variance Reduction for Convex Composite Optimization
by: Fang, Changjie, et al.
Published: (2025)

Convergence analysis of a primal-dual optimization-by-continuation algorithm
by: Loris, Ignace, et al.
Published: (2023)

New Primal-Dual Algorithm for Convex Problems
by: Liu, Shuning, et al.
Published: (2025)

First- and Second-Order Stochastic Adaptive Regularization with Cubics: High Probability Iteration and Sample Complexity
by: Scheinberg, Katya, et al.
Published: (2023)

A finitely convergent circumcenter method for the Convex Feasibility Problem
by: Behling, Roger, et al.
Published: (2023)

A Near-Optimal Total Complexity for the Inexact Accelerated Proximal Gradient Method via Quadratic Growth
by: Li, Hongda, et al.
Published: (2026)

Error Bounds for a Class of Cone-Convex Inclusion Problems
by: Huy, Nguyen Quang, et al.
Published: (2025)

A preconditioned difference of convex functions algorithm with extrapolation and line search
by: Zhang, Ran, et al.
Published: (2025)

Generalized Steepest Descent Methods on Riemannian Manifolds and Hilbert Spaces: Convergence Analysis and Stochastic Extensions
by: A., Rashid, et al.
Published: (2025)

On Averaging and Extrapolation for Gradient Descent
by: Luner, Alan, et al.
Published: (2024)