Imagen de Portada

First Order Algorithm on an Optimization Problem with Improved Convergence when Problem is Convex

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Sim, Chee-Khian
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Superlinear Convergence of an Interior Point Algorithm on Linear Semi-definite Feasibility Problems
por: Sim, Chee-Khian
Publicado: (2022)

Reduction from the partition problem: Dynamic lot sizing problem with polynomial complexity
por: Sim, Chee-Khian
Publicado: (2024)

Optimal Primal-Dual Algorithm with Last iterate Convergence Guarantees for Stochastic Convex Optimization Problems
por: Boob, Digvijay, et al.
Publicado: (2024)

Adaptive Algorithms for Relatively Lipschitz Continuous Convex Optimization Problems
por: Stonyakin, Fedor, et al.
Publicado: (2021)

Power of Generalized Smoothness in Stochastic Convex Optimization: First- and Zero-Order Algorithms
por: Lobanov, Aleksandr, et al.
Publicado: (2025)

Relaxed Lagrangian Approach to First-Order Non-Convex Mean Field Type Control Problem
por: Mendico, Cristian, et al.
Publicado: (2024)

First- and Second-Order Analysis for Optimization Problems with Manifold-Valued Constraints
por: Bergmann, Ronny, et al.
Publicado: (2021)

Linear Convergence of a Unified Primal--Dual Algorithm for Convex--Concave Saddle Point Problems with Quadratic Growth
por: Melcher, Cody, et al.
Publicado: (2025)

Optimization with First Order Algorithms
por: Dossal, Charles, et al.
Publicado: (2024)

Convex Synthesis of First-Order Methods for Time-Varying Smooth Strongly Convex Optimization
por: Van Scoy, Bryan, et al.
Publicado: (2026)

New Outer Approximation Algorithms for Nonsmooth Convex MINLP Problems
por: Wei, Zhou, et al.
Publicado: (2026)

More Optimal Fractional-Order Stochastic Gradient Descent for Non-Convex Optimization Problems
por: Partohaghighi, Mohammad, et al.
Publicado: (2025)

Effective Dimension Aware Fractional-Order Stochastic Gradient Descent for Convex Optimization Problems
por: Partohaghighi, Mohammad, et al.
Publicado: (2025)

Federated Incremental Subgradient Method for Convex Bilevel Optimization Problems
por: Boontawee, Sudkobfa, et al.
Publicado: (2026)

Single-Projection Procedure for Infinite Dimensional Convex Optimization Problems
por: Bui, Hoa T., et al.
Publicado: (2022)

A Fast and Convergent Algorithm for Unassigned Distance Geometry Problems
por: Fan, Jun, et al.
Publicado: (2025)

Accelerated Gradient Methods for Geodesically Convex Optimization: Tractable Algorithms and Convergence Analysis
por: Kim, Jungbin, et al.
Publicado: (2022)

Convexity in Optimal Control Problems
por: Abhijeet, et al.
Publicado: (2024)

Efficient First Order Method for Saddle Point Problems with Higher Order Smoothness
por: Wang, Nuozhou, et al.
Publicado: (2023)

Graph Isomorphism: Mixed-Integer Convex Optimization from First-Order Methods
por: Xiao, Wenjie, et al.
Publicado: (2025)

A First-Order Algorithm for Decentralised Min-Max Problems
por: Malitsky, Yura, et al.
Publicado: (2023)

An Efficient Solution Method for Solving Convex Separable Quadratic Optimization Problems
por: Li, Shaoze, et al.
Publicado: (2025)

Fixed-Point Delayed Subgradient Methods for Nonsmooth Convex Optimization Problems
por: Pankoon, Ontima, et al.
Publicado: (2026)

Marginal Analysis of Convex Optimization Problems with Set-Valued Inclusion Constraints
por: Uderzo, Amos
Publicado: (2024)

A Parameter-Free Zeroth-Order Algorithm for Decentralized Stochastic Convex Optimization
por: Chen, Jiawei, et al.
Publicado: (2026)

Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent
por: Rotaru, Teodor, et al.
Publicado: (2025)

Stochastic Decentralized Optimization of Non-Smooth Convex and Convex-Concave Problems over Time-Varying Networks
por: Divilkovskiy, Maxim, et al.
Publicado: (2025)

Convergence of First-Order Algorithms with Momentum from the Perspective of an Inexact Gradient Descent Method
por: Khanh, Pham Duy, et al.
Publicado: (2025)

First-Order Projected Algorithms With the Same Linear Convergence Rate Bounds as Their Unconstrained Counterparts
por: Li, Mengmou, et al.
Publicado: (2025)

Functionally Constrained Algorithm Solves Convex Simple Bilevel Problems
por: Zhang, Huaqing, et al.
Publicado: (2024)

Optimizing Representation in Redistricting: Dual Bounds for Partitioning Problems with Non-Convex Objectives
por: Fravel, Jamie, et al.
Publicado: (2023)

Adaptive Variant of Frank-Wolfe Method for Relative Smooth Convex Optimization Problems
por: Vyguzov, Alexander, et al.
Publicado: (2024)

On the (almost) Global Exponential Convergence of the Overparameterized Policy Optimization for the LQR Problem
por: Wafi, Moh Kamalul, et al.
Publicado: (2025)

A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization
por: Ren, Kunjie, et al.
Publicado: (2025)

Improved Iteration Complexity in Black-Box Optimization Problems under Higher Order Smoothness Function Condition
por: Lobanov, Aleksandr
Publicado: (2024)

Convergence Error Analysis of Reflected Gradient Langevin Dynamics for Globally Optimizing Non-Convex Constrained Problems
por: Sato, Kanji, et al.
Publicado: (2022)

Robust and Efficient Embedded Convex Optimization through First-Order Adaptive Caching
por: Mahajan, Ishaan, et al.
Publicado: (2025)

Bayesian Optimization for Non-Convex Two-Stage Stochastic Optimization Problems
por: Buckingham, Jack M., et al.
Publicado: (2024)

Stochastic Optimization Algorithms for Problems with Controllable Biased Oracles
por: Liu, Yin, et al.
Publicado: (2023)

A Block-Alternating Iterative Approach for a Class of Non-Convex Optimization Problems
por: Li, Anran, et al.
Publicado: (2026)