Copertina

Globally Optimal Solutions to a Class of Fractional Optimization Problems Based on Proximal Gradient Algorithm

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Lin, Yizun, Cai, Jian-Feng, Lai, Zhao-Rong, Li, Cheng
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Optimization and Control Numerical Analysis 90C26, 90C32, 65K05
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A Globally Optimal Portfolio for m-Sparse Sharpe Ratio Maximization
di: Lin, Yizun, et al.
Pubblicazione: (2024)

A Single-loop Proximal Subgradient Algorithm for A Class Structured Fractional Programs
di: Han, Deren, et al.
Pubblicazione: (2025)

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

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

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

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

A simple iterative algorithm for maxcut
di: Shao, Sihong, et al.
Pubblicazione: (2018)

Continuous iterative algorithms for anti-Cheeger cut
di: Shao, Sihong, et al.
Pubblicazione: (2021)

Optimality Conditions and Duality for Multiobjective Fractional Bilevel Optimization Problems
di: Lara, Felipe, et al.
Pubblicazione: (2025)

Optimization in complex spaces with the Mixed Newton Method
di: Bakhurin, Sergey, et al.
Pubblicazione: (2022)

AS-BOX: Additional Sampling Method for Weighted Sum Problems with Box Constraints
di: Krejić, Nataša, et al.
Pubblicazione: (2025)

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

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

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

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
di: Chen, Xiaojun, et al.
Pubblicazione: (2022)

A Krasnoselskii-Mann Proximity Algorithm for Markowitz Portfolios with Adaptive Expected Return Level
di: Lin, Yizun, et al.
Pubblicazione: (2024)

Proximal Limited-Memory Quasi-Newton Methods for Nonsmooth Nonconvex Optimization
di: Dahl, Simeon vom, et al.
Pubblicazione: (2026)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
di: Deng, Kangkang, et al.
Pubblicazione: (2025)

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

An Algorithm to Solve Cardinality Constrained Quadratic Optimization Problem with an Application to the Best Subset Selection in Regression
di: Singh, Vikram, et al.
Pubblicazione: (2025)

A Convergent ADMM Algorithm for Grain Boundary Energy Minimization
di: Wu, Yue, et al.
Pubblicazione: (2024)

Adaptive Preconditioned Gradient Descent with Energy
di: Liu, Hailiang, et al.
Pubblicazione: (2023)

Mixed Newton Method for Optimization in Complex Spaces
di: Yudin, Nikita, et al.
Pubblicazione: (2024)

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

A full splitting algorithm for fractional programs with structured numerators and denominators
di: Boţ, Radu Ioan, et al.
Pubblicazione: (2023)

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
di: Jung, Woosuk L., et al.
Pubblicazione: (2023)

Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs
di: Kannan, Rohit, et al.
Pubblicazione: (2022)

Extrapolated Plug-and-Play Three-Operator Splitting Methods for Nonconvex Optimization with Applications to Image Restoration
di: Wu, Zhongming, et al.
Pubblicazione: (2024)

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
di: Monteiro, Renato D. C., et al.
Pubblicazione: (2024)

A Theory of the NEPv Approach for Optimization On the Stiefel Manifold
di: Li, Ren-Cang
Pubblicazione: (2023)

Proximal Nonlinear Conjugate Gradient Methods for Composite Optimization
di: Hamana, Shodai, et al.
Pubblicazione: (2026)

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

A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction
di: Milzarek, Andre, et al.
Pubblicazione: (2022)

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

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

On Optimality Conditions for Mathematical Programming Problems Based on Strong Subdifferentials
di: Lara, Felipe, et al.
Pubblicazione: (2026)

Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
di: Turan, Evren M., et al.
Pubblicazione: (2023)

Computing the Proximal Operator of the $q$-th Power of the $\ell_{1,q}$-norm for Group Sparsity
di: Lin, Rongrong, et al.
Pubblicazione: (2024)

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

Splitting the Conditional Gradient Algorithm
di: Woodstock, Zev, et al.
Pubblicazione: (2023)