Projected quasi-subgradient method for Hölder continuous quasi-convex multiobjective optimization

DOI10.1007/S11117-026-01225-4MaRDI QIDQ7363752zbMATH OpenFDO

Authors Feeroz Babu, Debdas Ghosh

Publication date 30 September 2026

Published in Positivity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11117-026-01225-4

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Numerical methods based on nonlinear programming (49M37) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)

Cites work

• A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
• A novel class of spectral conjugate gradient methods for unconstrained multiobjective optimization with practical application in image processing
• A projected gradient method for vector optimization problems
• A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
• A subgradient method for vector optimization problems
• A subgradient projection method for quasiconvex multiobjetive optimization
• A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
• A weighting subgradient algorithm for multiobjective optimization
• Abstract convergence theorem for quasi-convex optimization problems with applications
• Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria
• An accelerated proximal gradient method for multiobjective optimization
• An inexact proximal point method for quasiconvex multiobjective optimization
• An inexact proximal point method with quasi-distance for quasi-convex multiobjective optimization
• An inexact scalarization proximal point method for multiobjective quasiconvex minimization
• Benchmarking optimization software with performance profiles.
• Convergence and efficiency of subgradient methods for quasiconvex minimization
• Full convergence of the steepest descent method with inexact line searches
• scientific article; zbMATH DE number 47208 (Why is no real title available?)
• scientific article; zbMATH DE number 3435272 (Why is no real title available?)
• Inexact subgradient methods for quasi-convex optimization problems
• Lower subdifferentiable functions and their minimization by cutting planes
• Multiobjective optimization: a brief overview
• Newton's method for multiobjective optimization
• Nonlinear multiobjective optimization
• Nonmonotone proximal gradient method for composite multiobjective optimization problems
• Normal characterization of the main classes of quasiconvex functions
• OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility
• On Convergence Properties of a Subgradient Method
• On properties of supporting and quasi-supporting vectors
• On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
• Proximal gradient method for convex multiobjective optimization problems without Lipschitz continuous gradients
• Steepest descent methods for multicriteria optimization.
• The generalized conditional gradient method for multiobjective composite optimization problems with non-monotone line search
• Vector variational inequalities and vector optimization. Theory and applications

This page was built for publication: Projected quasi-subgradient method for Hölder continuous quasi-convex multiobjective optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363752)