:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Tifroute, Mohamed, Lahmdani, Anouar, Bouzahir, Hassane
Format:	Preprint
Published:	2020
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2011.04866
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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)

Block Coordinate Descent Methods for Structured Nonconvex Optimization with Nonseparable Constraints: Optimality Conditions and Global Convergence
by: Yuan, Zhijie, 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)

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

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

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

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

Modified Line Search Sequential Quadratic Methods for Equality-Constrained Optimization with Unified Global and Local Convergence Guarantees
by: Berahas, Albert S., et al.
Published: (2024)

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

Super Gradient Descent: Global Optimization requires Global Gradient
by: Achour, Seifeddine
Published: (2024)

The Stochastic Steepest Descent Method for Robust Optimization in Banach Spaces
by: Chada, Neil K., et al.
Published: (2023)

The Method of Infinite Descent
by: Batley, Reza T., et al.
Published: (2025)

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

A Nonmonotone Descent Method for Optimization Problems Defined by Upper-$\mathcal{C}^2 $ Functions over Submanifolds
by: Kanzow, Christian, et al.
Published: (2026)

An Inexact General Descent Method with Applications in Differential Equation-Constrained Optimization
by: Macedo, Humberto Gimenes, et al.
Published: (2025)

Gradient Descent for Convex and Smooth Noisy Optimization
by: Hu, Feifei, et al.
Published: (2024)

Composing Optimized Stepsize Schedules for Gradient Descent
by: Grimmer, Benjamin, et al.
Published: (2024)

A Sequential Cubic Programming Method with Second-Order Complexity Guarantees for Equality Constrained Optimization
by: Dimou, Nikos, et al.
Published: (2026)

Real-time Hosting Capacity Assessment for Electric Vehicles: A Sequential Forecast-then-Optimize Method
by: Zhuang, Yingrui, et al.
Published: (2024)

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

On the Perturbed Projection-Based Distributed Gradient-Descent Algorithm: A Fully-Distributed Adaptive Redesign
by: Bazizi, Tarek, et al.
Published: (2025)

IRKA is a Riemannian Gradient Descent Method
by: Mlinarić, Petar, et al.
Published: (2023)

Projected Gradient Descent for Constrained Decision-Dependent Optimization
by: Wang, Zifan, et al.
Published: (2025)

Accelerated Mirror Descent Method through Variable and Operator Splitting
by: Chen, Long, et al.
Published: (2026)

On a Family of Relaxed Gradient Descent Methods for Quadratic Minimization
by: MacDonald, Liam, et al.
Published: (2024)

Block Coordinate Descent Network Simplex Methods for Optimal Transport
by: Li, Lingrui, et al.
Published: (2025)

The Randomized Block Coordinate Descent Method in the Hölder Smooth Setting
by: Maia, Leandro Farias, et al.
Published: (2024)

A Globalized Semismooth Newton Method for Prox-regular Optimization Problems
by: Wu, Yuqia, et al.
Published: (2025)

INTHOP: A Second-Order Globally Convergent Method for Nonconvex Optimization
by: Kumar, Krishan, et al.
Published: (2025)

Dictionary-Restricted First-Order Descent Methods: Bounds and Convergence Rates
by: Berasategui, Miguel, et al.
Published: (2026)

A Communication-Efficient Stochastic Gradient Descent Algorithm for Distributed Nonconvex Optimization
by: Xie, Antai, et al.
Published: (2024)

Dissipative Gradient Descent Ascent Method: A Control Theory Inspired Algorithm for Min-max Optimization
by: Zheng, Tianqi, et al.
Published: (2024)

Homogeneous Second-Order Descent Framework: A Fast Alternative to Newton-Type Methods
by: He, Chang, et al.
Published: (2023)

A discrete Consensus-Based Global Optimization Method with Noisy Objective Function
by: Bellavia, Stefania, et al.
Published: (2024)

The Trajectory Bundle Method: Unifying Sequential-Convex Programming and Sampling-Based Trajectory Optimization
by: Tracy, Kevin, et al.
Published: (2025)

On Penalty-based Bilevel Gradient Descent Method
by: Shen, Han, et al.
Published: (2023)

Fast Monte Carlo Analysis for 6-DoF Powered-Descent Guidance via GPU-Accelerated Sequential Convex Programming
by: Chari, Govind M., et al.
Published: (2024)