Cover Image

A Nonmonotone Descent Method for Optimization Problems Defined by Upper-$\mathcal{C}^2 $ Functions over Submanifolds

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kanzow, Christian, Lehmann, Leo
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Convergence of Nonmonotone Proximal Gradient Methods under the Kurdyka-Lojasiewicz Property without a Global Lipschitz Assumption
by: Kanzow, Christian, et al.
Published: (2024)

AGDA+: Proximal Alternating Gradient Descent Ascent Method with a Nonmonotone Adaptive Step-Size Search for Nonconvex Minimax Problems
by: Zhang, Xuan, et al.
Published: (2024)

A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization
by: Mansueto, Pierluigi
Published: (2025)

A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems
by: Anh, Nguyen Duc, et al.
Published: (2025)

Nonmonotone Trust-Region Methods for Optimization of Set-Valued Mapping of Finite Cardinality
by: Ghosh, Suprova, et al.
Published: (2025)

Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems
by: Yuan, Bowen, et al.
Published: (2025)

Nonmonotone Spectral Analysis for Variational Inclusions
by: Hazaimah, Oday
Published: (2025)

Regret Analysis of Policy Optimization over Submanifolds for Linearly Constrained Online LQG
by: Chang, Ting-Jui, et al.
Published: (2024)

A Sequential Descent Method for Global Optimization
by: Tifroute, Mohamed, et al.
Published: (2020)

Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method
by: Han, Andi, et al.
Published: (2025)

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

Stochastic Gradient Descent for Constrained Optimization based on Adaptive Relaxed Barrier Functions
by: Dimitrieski, Naum, et al.
Published: (2025)

Riemannian Momentum Tracking: Distributed Optimization with Momentum on Compact Submanifolds
by: Chen, Jun, et al.
Published: (2026)

Distributed Stochastic Proximal Algorithm on Riemannian Submanifolds for Weakly-convex Functions
by: Zhao, Jishu, et al.
Published: (2025)

A Proximal Descent Method for Minimizing Weakly Convex Optimization
by: Liao, Feng-Yi, et al.
Published: (2025)

Randomized Submanifold Subgradient Method for Optimization over Stiefel Manifolds
by: Cheung, Andy Yat-Ming, et al.
Published: (2024)

A Homogeneous Second-Order Descent Method for Nonconvex Optimization
by: Zhang, Chuwen, et al.
Published: (2022)

Adaptive Accelerated Gradient Descent Methods for Convex Optimization
by: Xu, Zeyi, et al.
Published: (2026)

Decentralized Relaxed Smooth Optimization with Gradient Descent Methods
by: Jiang, Zhanhong, et al.
Published: (2025)

Nonmonotone higher-order Taylor approximation methods for composite problems
by: Nabou, Yassine
Published: (2025)

Improving the Robustness of the Projected Gradient Descent Method for Nonlinear Constrained Optimization Problems in Topology Optimization
by: Barbeau, Lucka, et al.
Published: (2024)

Generalized Stochastic Gradient Descent with Momentum Methods for Smooth Optimization
by: Wang, Zimeng, et al.
Published: (2026)

Mirror Descent Methods with Weighting Scheme for Outputs for Constrained Variational Inequality Problems
by: Alkousa, Mohammad S., et al.
Published: (2025)

Decentralized Optimization on Compact Submanifolds by Quantized Riemannian Gradient Tracking
by: Chen, Jun, et al.
Published: (2025)

AN-SPS: Adaptive Sample Size Nonmonotone Line Search Spectral Projected Subgradient Method for Convex Constrained Optimization Problems
by: Jerinkić, Nataša Krklec, et al.
Published: (2022)

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

A New Inexact Gradient Descent Method with Applications to Nonsmooth Convex Optimization
by: Khanh, Pham Duy, et al.
Published: (2023)

Primal-dual Accelerated Mirror-Descent Method for Constrained Bilinear Saddle-Point Problems
by: Li, Weijian, et al.
Published: (2024)

A Smooth Locally Exact Penalty Method for Optimization Problems over Generalized Stiefel Manifolds
by: Jiang, Linshuo, et al.
Published: (2026)

Descent-Net: Learning Descent Directions for Constrained Optimization
by: Zhou, Zisheng, et al.
Published: (2025)

VFOG: Variance-Reduced Fast Optimistic Gradient Methods for a Class of Nonmonotone Generalized Equations
by: Tran-Dinh, Quoc, et al.
Published: (2025)

Frictionless Hamiltonian Descent and Coordinate Hamiltonian Descent for Strongly Convex Quadratic Problems
by: Wang, Jun-Kun
Published: (2024)

Quantum Hamiltonian Descent based Augmented Lagrangian Method for Constrained Nonconvex Nonlinear Optimization
by: Li, Mingze, et al.
Published: (2025)

A Method of the Quasidifferential Descent in a Problem of Bringing a Nonsmooth System from One Point to Another
by: Fominyh, Alexander
Published: (2022)

Gradient Descent Is Optimal Under Lower Restricted Secant Inequality And Upper Error Bound
by: Guille-Escuret, Charles, et al.
Published: (2022)

Mirror Descent-Type Algorithms for the Variational Inequality Problem with Functional Constraints
by: Alkousa, Mohammad S., et al.
Published: (2026)

An Efficient Numerical Function Optimization Framework for Constrained Nonlinear Robotic Problems
by: Sovukluk, Sait, et al.
Published: (2025)

Optimization of Linear Multi-Agent Dynamical Systems via Feedback Distributed Gradient Descent Methods
by: Mehrnoosh, Amir, et al.
Published: (2024)

Global Convergence and Rate Analysis of the Steepest Descent Method for Uncertain Multiobjective Optimization via a Robust Optimization Approach
by: Kumar, Shubham, et al.
Published: (2025)

Lipschitz-Free Mirror Descent Methods for Relatively Strongly Convex Functions with/without Absolute and Relative Inexactness
by: Alkousa, Mohammad S., et al.
Published: (2026)