Imagen de Portada

Lower Complexity Bounds of First-order Methods for Affinely Constrained Composite Non-convex Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Liu, Wei, Lin, Qihang, Xu, Yangyang
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

A Near-optimal Method for Linearly Constrained Composite Non-convex Non-smooth Problems
por: Liu, Wei, et al.
Publicado: (2025)

Inexact Moreau Envelope Lagrangian Method for Non-Convex Constrained Optimization under Local Error Bound Conditions on Constraint Functions
por: Huang, Yankun, et al.
Publicado: (2025)

Penalty-Based First-Order Methods for Bilevel Optimization with Minimax and Constrained Lower-Level Problems
por: Shen, Yiyang, et al.
Publicado: (2026)

A Note on Complexity for Two Classes of Structured Non-Smooth Non-Convex Compositional Optimization
por: Yao, Yao, et al.
Publicado: (2024)

An Adaptive Parameter-free and Projection-free Restarting Level Set Method for Constrained Convex Optimization Under the Error Bound Condition
por: Lin, Qihang, et al.
Publicado: (2020)

Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness
por: Crawshaw, Michael, et al.
Publicado: (2025)

Alternating Direction Method of Multipliers for nonlinear constrained convex problems and applications to distributed resource allocation and constrained machine learning
por: Xiong, Zhengjie, et al.
Publicado: (2026)

Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints
por: Dahal, Hari, et al.
Publicado: (2023)

On the Oracle Complexity of a Riemannian Inexact Augmented Lagrangian Method for Riemannian Nonsmooth Composite Problems
por: Xu, Meng, et al.
Publicado: (2024)

Tight Lower Bounds for the Bit and Inner Product Oracle for Constrained Convex Optimization
por: Basu, Amitabh, et al.
Publicado: (2025)

Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles
por: Ji, Kaiyi
Publicado: (2025)

On the Nature of Regularity Assumptions in Bilevel Optimization with Constrained Lower-level Problem
por: Jiang, Xiaotian, et al.
Publicado: (2026)

Deterministic and Stochastic Accelerated Gradient Method for Convex Semi-Infinite Optimization
por: Yao, Yao, et al.
Publicado: (2023)

Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets
por: Grimmer, Benjamin, et al.
Publicado: (2026)

Convergence Analysis of an Inexact MBA Method for Constrained DC Problems
por: Liu, Ruyu, et al.
Publicado: (2025)

Primal-Dual Bundle Methods for Linear Equality-Constrained Problems
por: Zheng, Zhuoqing, et al.
Publicado: (2025)

First-order SDSOS-convex semi-algebraic optimization and exact SOCP relaxations
por: Yang, Chengmiao, et al.
Publicado: (2025)

Bayesian Optimization with Lower Confidence Bounds for Minimization Problems with Known Outer Structure
por: Baumgärtner, Katrin, et al.
Publicado: (2025)

On the Complexity of Lower-Order Implementations of Higher-Order Methods
por: Doikov, Nikita, et al.
Publicado: (2025)

Spectral Preconditioning for Gradient Methods on Graded Non-convex Functions
por: Doikov, Nikita, et al.
Publicado: (2024)

An Inexact Preconditioned Zeroth-order Proximal Method for Composite Optimization
por: Liu, Shanglin, et al.
Publicado: (2024)

Convergence Guarantees for RMSProp and Adam in Generalized-smooth Non-convex Optimization with Affine Noise Variance
por: Zhang, Qi, et al.
Publicado: (2024)

A Stochastic Quasi-Newton Method for Non-convex Optimization with Non-uniform Smoothness
por: Sun, Zhenyu, et al.
Publicado: (2024)

Derivative-Free Bound-Constrained Optimization for Solving Structured Problems with Surrogate Models
por: Curtis, Frank E., et al.
Publicado: (2022)

Riemannian Accelerated Zeroth-order Algorithm: Improved Robustness and Lower Query Complexity
por: He, Chang, et al.
Publicado: (2024)

Uniformly Optimal and Parameter-free First-order Methods for Convex and Function-constrained Optimization
por: Deng, Qi, et al.
Publicado: (2024)

High Probability Convergence Bounds for Non-convex Stochastic Gradient Descent with Sub-Weibull Noise
por: Madden, Liam, et al.
Publicado: (2020)

New Lower Bounds for Stochastic Non-Convex Optimization through Divergence Decomposition
por: Saad, El Mehdi, et al.
Publicado: (2025)

Online Non-convex Optimization with Long-term Non-convex Constraints
por: Pan, Shijie, et al.
Publicado: (2023)

Lower Bounds on the Haraux Function
por: Combettes, Patrick L., et al.
Publicado: (2025)

An Augmented Lagrangian Value Function Method for Lower-level Constrained Stochastic Bilevel Optimization
por: Nie, Hantao, et al.
Publicado: (2025)

Non-convex Stochastic Composite Optimization with Polyak Momentum
por: Gao, Yuan, et al.
Publicado: (2024)

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

A Non-Interior-Point Continuation Method for the Optimal Control Problem with Equilibrium Constraints
por: Lin, Kangyu, et al.
Publicado: (2022)

Stochastic Linear-quadratic Control Problems with Affine Constraints
por: Gou, Zhun, et al.
Publicado: (2022)

Full-Low Evaluation Methods For Bound and Linearly Constrained Derivative-Free Optimization
por: Royer, Clément W., et al.
Publicado: (2023)

Revisit First-order Methods for Geodesically Convex Optimization
por: Shu, Yunlu, et al.
Publicado: (2025)

Solve the General Constrained Optimal Control Problem with Common Integration Method
por: Zhang, Sheng, et al.
Publicado: (2018)

Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization
por: Jiang, Ruichen, et al.
Publicado: (2024)

Remarks on "Successive Convexification: A Superlinearly Convergent Algorithm for Non-convex Optimal Control Problems"
por: Luo, Dayou, et al.
Publicado: (2024)