No article text was recorded for this version.
Lipschitz continuity requirement
Version 1 of 1288 papers307 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions
- Blog: A Newton Frank-Wolfe method for constrained self-concordant minimization
- Blog: Every Call is Precious: Global Optimization of Black-Box Functions with Unknown Lipschitz Constants
- Blog: A Bregman Divergence View on the Difference-of-Convex Algorithm
- Blog: Proximal Gradient Algorithms under Local Lipschitz Gradient Continuity: A Convergence and Robustness Analysis of PANOC
- Blog: A Unified Analysis on the Subgradient Upper Bounds for the Subgradient Methods Minimizing Composite Nonconvex, Nonsmooth, and Non-Lipschitz Functions
- Blog: Revisiting Subgradient Method: Complexity and Convergence Beyond Lipschitz Continuity
- Blog: From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization
- Blog: Linearly Constrained Bilevel Optimization: A Smoothed Implicit Gradient Approach
- Blog: Convergence of the Exponentiated Gradient Method with Armijo Line Search
- Blog: A Primal-Dual Approach to Solving Variational Inequalities with General Constraints
- Blog: A Fast Non-Smooth Nonnegative Matrix Factorization for Learning Sparse Representation
- Blog: Fastest rates for stochastic mirror descent methods
- Blog: Nonlinearly Preconditioned Gradient Methods under Generalized Smoothness
- Blog: One Method for Minimization a Convex Lipschitz-Continuous Function of 2 Variables on a Fixed Square
- Blog: A General Convergence Result for Mirror Descent with Armijo Line Search
- Blog: A New One-Point Residual-Feedback Oracle for Black-Box Learning and Control
- Blog: Order Optimal One-Shot Distributed Learning
- Blog: Frank-Wolfe works for non-Lipschitz continuous gradient objectives: Scalable poisson phase retrieval.
- Blog: Statistical Query Algorithms for Stochastic Convex Optimization
- Blog: Efficiently avoiding saddle points with zero order methods: No gradients required
- Blog: Symbol-Level Precoding Through the Lens of Zero Forcing and Vector Perturbation
- Blog: A Bregman Proximal Stochastic Gradient Method with Extrapolation for Nonconvex Nonsmooth Problems
- Blog: Extending Kernel PCA through Dualization: Sparsity, Robustness and Fast Algorithms
- Blog: Overcoming the curse of dimensionality in the numerical approximation of high-dimensional semilinear elliptic partial differential equations
- Blog: Achieving Linear Speedup with ProxSkip in Distributed Stochastic Optimization
- Blog: On the Convergence Analysis of an Inexact Preconditioned Stochastic Model-Based Algorithm
- Blog: On Frank-Wolfe Adversarial Training
- Blog: A Newton Frank-Wolfe Method for Constrained Self-Concordant Minimization
- Blog: Fast rates with high probability in exp-concave statistical learning
- Blog: Clarke subgradients of stratifiable functions
- Blog: Nonasymptotic estimates for Stochastic Gradient Langevin Dynamics under local conditions in nonconvex optimization
- Blog: Dynamic Regret of Online Mirror Descent for Relatively Smooth Convex Cost Functions
- Blog: A note on the convergence of nonconvex line search
- Blog: Frank-Wolfe works for non-Lipschitz continuous gradient objectives: Scalable poisson phase retrieval
- Blog: Sharper Rates and Flexible Framework for Nonconvex SGD with Client and Data Sampling
- Blog: Non-convex Distributionally Robust Optimization: Non-asymptotic Analysis
- Blog: Stochastic Composition Optimization of Functions Without Lipschitz Continuous Gradient
- Blog: ProxSARAH: An Efficient Algorithmic Framework for Stochastic Composite Nonconvex Optimization
- Blog: Sample Average Approximation for Stochastic Programming with Equality Constraints
- Blog: Stochastic Gauss-Newton Algorithms for Nonconvex Compositional Optimization
- Blog: Probabilistic Submodular Maximization in Sub-Linear Time
- Blog: Optimum-statistical Collaboration Towards General and Efficient Black-box Optimization
- Blog: Dual optimization for convex constrained objectives without the gradient-Lipschitz assumption
- Blog: A Gradient Smoothed Functional Algorithm with Truncated Cauchy Random Perturbations for Stochastic Optimization
- Blog: Homeomorphic-Invariance of EM: Non-Asymptotic Convergence in KL Divergence for Exponential Families via Mirror Descent (Extended Abstract)
- Blog: Stochastic Conditional Gradient Methods: From Convex Minimization to Submodular Maximization
- Blog: Multi-block Bregman proximal alternating linearized minimization and its application to sparse orthogonal nonnegative matrix factorization
- Blog: Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity
- Blog: Extragradient Method: O(1/K) Last-Iterate Convergence for Monotone Variational Inequalities and Connections With Cocoercivity
- Blog: Langevin Monte Carlo without Smoothness
- Blog: Simple steps are all you need: Frank-Wolfe and generalized self-concordant functions
- Blog: Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization
- Blog: Graph Balancing for Distributed Subgradient Methods over Directed Graphs
- Blog: Adaptive Methods or Variational Inequalities with Relatively Smooth and Reletively Strongly Monotone Operators
- Blog: Halpern-Type Accelerated and Splitting Algorithms For Monotone Inclusions
- Blog: Continuity of Cost in Borkar Control Topology and Implications on Discrete Space and Time Approximations for Controlled Diffusions under Several Criteria
- Blog: Block Alternating Bregman Majorization Minimization with Extrapolation
- Blog: Generalized Conditional Gradient with Augmented Lagrangian for Composite Minimization
- Blog: Fastest Rates for Stochastic Mirror Descent Methods
Showing 60 of 288 papers.
History & citation
Current · Permanent link
- Robust Convergence for Non-Lipschitz Variational Inequalities merged into this direction (50% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_lipschitz_continuity_requirement_da152346,
title = {Lipschitz continuity requirement},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/lipschitz-continuity-requirement/rdr_da152346b8d44c61af1094e97f10a177},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_lipschitz_continuity_requirement_da152346_v1,
title = {Lipschitz continuity requirement},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/lipschitz-continuity-requirement/rdr_da152346b8d44c61af1094e97f10a177/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}