Cover Image

An equivalent reformulation and multi-proximity gradient algorithms for a class of nonsmooth fractional programming

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhou, Junpeng, Zhang, Na, Li, Qia
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
by: Zhou, Junpeng, et al.
Published: (2025)

An efficient proximal algorithm for squared L1 over L2 regularized sparse recovery
by: Zhang, Na, et al.
Published: (2025)

Projected proximal gradient trust-region algorithm for nonsmooth optimization
by: Dao, Minh N., et al.
Published: (2025)

Extended alternating structure-adapted proximal gradient algorithm for nonconvex nonsmooth problems
by: Gao, Ying, et al.
Published: (2024)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
by: Li, Qia, et al.
Published: (2024)

A proximal algorithm incorporating difference of convex functions optimization for solving a class of single-ratio fractional programming
by: Qi, Anna, et al.
Published: (2025)

New reformulations for 0-1 quadratic programming problem using quadratic nonconvex reformulation techniques and valid inequalities
by: Lu, Cheng, et al.
Published: (2026)

A consensus-based optimization method for nonsmooth nonconvex programs with approximated gradient descent scheme
by: Wei, Jiazhen, et al.
Published: (2025)

Inexact JKO and proximal-gradient algorithms in the Wasserstein space
by: Di Marino, Simone, et al.
Published: (2025)

A reformulation-enumeration MINLP algorithm for gas network design
by: Li, Yijiang, et al.
Published: (2023)

A multilevel proximal trust-region method for nonsmooth optimization with applications
by: Baraldi, Robert, et al.
Published: (2025)

Theoretical and numerical comparison of seven single-level reformulations for bilevel programs
by: Li, Yu-Wei, et al.
Published: (2025)

Optimality conditions for bilevel programs via Moreau envelope reformulation
by: Bai, Kuang, et al.
Published: (2023)

A nonmonotone extrapolated proximal gradient-subgradient algorithm beyond global Lipschitz gradient continuity
by: Yang, Lei, et al.
Published: (2025)

Convex NMPC reformulations for a special class of nonlinear multi-input systems with application to rank-one bilinear networks
by: Klädtke, Manuel, et al.
Published: (2023)

On the robust isolated calmness of a class of nonsmooth optimizations on Riemannian manifolds and its applications
by: Bao, Chenglong, et al.
Published: (2022)

A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping
by: Zhang, Taiwei, et al.
Published: (2023)

An adaptive proximal safeguarded augmented Lagrangian method for nonsmooth DC problems with convex constraints
by: Kanzow, Christian, et al.
Published: (2025)

Stochastic smoothing accelerated gradient method for general constrained nonsmooth convex composite optimization
by: Wang, Ruyu, et al.
Published: (2023)

Approximate Bregman proximal gradient algorithm with variable metric Armijo--Wolfe line search
by: Fujiki, Kiwamu, et al.
Published: (2025)

An implementable proximal-type method for computing critical points to minimization problems with a nonsmooth and nonconvex constraint
by: Sempere, Gregorio M., et al.
Published: (2024)

A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
by: Pham, Tan Nhat, et al.
Published: (2022)

A reformulation to Embedding a Neural Network in a linear program without integer variables
by: -de-Alba, Héctor G., et al.
Published: (2024)

Solving mathematical programs with complementarity constraints arising in nonsmooth optimal control
by: Nurkanović, Armin, et al.
Published: (2023)

On the complexity of proximal gradient and proximal gradient-Newton-CG methods for \(\ell_1\)-regularized Optimization
by: Zhu, Hong
Published: (2025)

A smoothing Anderson acceleration algorithm for nonsmooth fixed point problem with linear convergence
by: Li, Zekai, et al.
Published: (2024)

Hypodifferentials of nonsmooth convex functions and their applications to nonsmooth convex optimization
by: Dolgopolik, M. V.
Published: (2023)

A single-loop proximal-conditional-gradient penalty method
by: Zhang, Hao, et al.
Published: (2024)

Concave tents: a new tool for constructing concave reformulations of a large class of nonconvex optimization problems
by: Gabl, Markus
Published: (2024)

On some perturbation properties of nonsmooth optimization on Riemannian manifolds with applications
by: Zhou, Yuexin, et al.
Published: (2023)

Adaptive sieving with semismooth Newton proximal augmented Lagrangian algorithm for multi-task Lasso problems
by: Lin, Lanyu, et al.
Published: (2025)

Variable Bregman Majorization-Minimization algorithms for nonconvex nonsmooth optimization, with application to Poisson imaging
by: Adly, Maxence, et al.
Published: (2026)

An effective subgradient algorithm via Mifflin's line search for nonsmooth nonconvex multiobjective optimization
by: Maleknia, Morteza, et al.
Published: (2024)

First-order algorithms for robust optimization problems via convex-concave saddle-point Lagrangian reformulation
by: Postek, Krzysztof, et al.
Published: (2021)

Unifying restart accelerated gradient and proximal bundle methods
by: Liang, Jiaming
Published: (2025)

Single-loop $\mathcal{O}(ε^{-3})$ stochastic smoothing algorithms for nonsmooth Riemannian optimization
by: Deng, Kangkang, et al.
Published: (2025)

Fast algorithm for sparse least trimmed squares via trimmed-regularized reformulation
by: Yagishita, Shotaro
Published: (2024)

Delay-tolerant distributed Bregman proximal algorithms
by: Chraibi, S., et al.
Published: (2024)

Integral control of the proximal gradient method for unbiased sparse optimization
by: Cerone, V., et al.
Published: (2025)

Primal-dual proximal bundle and conditional gradient methods for convex problems
by: Liang, Jiaming
Published: (2024)