Cover Image

Global Descent Method for Non-convex Multi-objective Optimization Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Adhikary, Bikram, Ansary, Md Abu Talhamainuddin, Treanta, Savin
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 90C29, 90C26, 65K10, 49M99
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

An Adaptive Order Caputo Fractional Gradient Descent Method for Multi-objective Optimization Problems
by: Shaw, Barsha, et al.
Published: (2025)

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

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

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)

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

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

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

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

Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization
by: Li, Hanyang, 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)

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

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

Inexact Proximal Point Algorithms for Zeroth-Order Global Optimization
by: Zhang, Minxin, et al.
Published: (2024)

Inertial Methods with Viscous and Hessian driven Damping for Non-Convex Optimization
by: Maulen-Soto, Rodrigo, et al.
Published: (2024)

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

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
by: Xie, Xiyuan, 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)

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

Nonlinear Separation Theorems for Co-Radiant Sets and Optimality Conditions for Approximate and Proper Approximate Solutions in Vector Optimization
by: García-Castaño, Fernando, et al.
Published: (2025)

GLL-type Nonmonotone Descent Methods Revisited under Kurdyka-Łojasiewicz Property
by: Qian, Yitian, et al.
Published: (2025)

Optimization on the Oblique Manifold for Sparse Simplex Constraints via Multiplicative Updates
by: Esposito, Flavia, et al.
Published: (2025)

Inexact Limited Memory Bundle Method
by: Lampainen, Jenni, et al.
Published: (2026)

Sublinear Scalarizations for Proper and Approximate Proper Efficient Points in Nonconvex Vector Optimization
by: García-Castaño, Fernando, et al.
Published: (2024)

Riemannian Trust Region Methods for SC$^1$ Minimization
by: Zhang, Chenyu, et al.
Published: (2023)

An Inexact Regularized Proximal Newton Method without Line Search
by: Dahl, Simeon vom, et al.
Published: (2024)

Non-Convex Self-Concordant Functions: Practical Algorithms and Complexity Analysis
by: Goldfarb, Donald, et al.
Published: (2025)

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

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

A General Recipe for Parameter-Free Nonconvex Optimization via Higher-Order Regularization
by: Marumo, Naoki, et al.
Published: (2026)

Cubic Regularization Technique of the Newton Method for Vector Optimization
by: Ghosh, Debdas
Published: (2025)

Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-based Reformulation
by: Bai, Xiaoning, et al.
Published: (2024)

An Algebraically Converging Stochastic Gradient Descent Algorithm for Global Optimization
by: Engquist, Björn, et al.
Published: (2022)

Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems
by: Hu, Yaling, et al.
Published: (2026)

A Refined Proximal Algorithm for Nonconvex Multiobjective Optimization in Hilbert Spaces
by: Bento, G. C., et al.
Published: (2024)

$\ell_0$-Norm Multiobjective Optimization Models Motivated by Applications to Proton Therapy
by: Cong, Xiaoda, et al.
Published: (2025)

Warm-starting outer approximation for parametrized convex MINLP
by: Tamm, Erik, et al.
Published: (2025)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
by: Marumo, Naoki
Published: (2025)