Imagen de Portada

Inexact Limited Memory Bundle Method

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Lampainen, Jenni, Joki, Kaisa, Karmitsa, Napsu, Mäkelä, Marko M.
Formato:	Preprint
Publicado:	2026
Materias:	Optimization and Control 90C26, 90C06, 49J52, 65K05
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A truncated epsilon-subdifferential method for global DC optimization
por: Bagirov, Adil M., et al.
Publicado: (2025)

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
por: Kabgani, Alireza, et al.
Publicado: (2025)

Clust-Splitter - an Efficient Nonsmooth Optimization-Based Algorithm for Clustering Large Datasets
por: Lampainen, Jenni, et al.
Publicado: (2025)

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
por: Kabgani, Alireza, et al.
Publicado: (2024)

Riemannian Trust Region Methods for SC$^1$ Minimization
por: Zhang, Chenyu, et al.
Publicado: (2023)

Quasar-Convex Optimization: Fundamental Properties and High-Order Proximal-Point Methods
por: Ahookhosh, Masoud, et al.
Publicado: (2026)

A penalty barrier framework for nonconvex constrained optimization
por: De Marchi, Alberto, et al.
Publicado: (2024)

Shadow splitting methods for nonconvex optimisation: epi-approximation, convergence and saddle point avoidance
por: Atenas, Felipe
Publicado: (2025)

Understanding the Douglas-Rachford splitting method through the lenses of Moreau-type envelopes
por: Atenas, Felipe
Publicado: (2023)

First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method
por: Kabgani, Alireza, et al.
Publicado: (2025)

Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization
por: Li, Hanyang, et al.
Publicado: (2025)

A relaxed version of Ryu's three-operator splitting method for structured nonconvex optimization
por: Alcantara, Jan Harold, et al.
Publicado: (2025)

A Near-Optimal Total Complexity for the Inexact Accelerated Proximal Gradient Method via Quadratic Growth
por: Li, Hongda, et al.
Publicado: (2026)

Nonmonotone subgradient methods based on a local descent lemma
por: Aragón-Artacho, Francisco J., et al.
Publicado: (2025)

Moreau envelope and proximal-point methods under the lens of high-order regularization
por: Kabgani, Alireza, et al.
Publicado: (2025)

An Inexact Boosted Difference of Convex Algorithm for Nondifferentiable Functions
por: Ferreira, Orizon P., et al.
Publicado: (2024)

Practical Regularized Quasi-Newton Methods with Inexact Function Values
por: Hamaguchi, Hiroki, et al.
Publicado: (2026)

A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
por: Käming, Isabella, et al.
Publicado: (2024)

Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
por: Latafat, Puya, et al.
Publicado: (2021)

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
por: Themelis, Andreas, et al.
Publicado: (2020)

A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
por: Ahookhosh, Masoud, et al.
Publicado: (2019)

Projected subgradient methods for paraconvex optimization: Application to robust low-rank matrix recovery
por: Rahimi, Morteza, et al.
Publicado: (2024)

(Adaptive) Scaled gradient methods beyond locally Holder smoothness: Lyapunov analysis, convergence rate and complexity
por: Ghaderi, Susan, et al.
Publicado: (2025)

Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
por: Latafat, Puya, et al.
Publicado: (2019)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
por: Zhou, Juan, et al.
Publicado: (2024)

An Inexact Proximal Newton Method for Nonconvex Composite Minimization
por: Zhu, Hong
Publicado: (2024)

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
por: Yang, Xiangyu, et al.
Publicado: (2021)

Convergence of the Preconditioned Proximal Point Method and Douglas-Rachford Splitting in the Absence of Monotonicity
por: Evens, Brecht, et al.
Publicado: (2023)

Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
por: Jin, Ruinan, et al.
Publicado: (2026)

Inexact Proximal Point Algorithms for Zeroth-Order Global Optimization
por: Zhang, Minxin, et al.
Publicado: (2024)

A Projected Variable Smoothing for Weakly Convex Optimization and Supremum Functions
por: López-Rivera, Sergio, et al.
Publicado: (2025)

An interior proximal gradient method for nonconvex optimization
por: De Marchi, Alberto, et al.
Publicado: (2022)

On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization
por: Gfrerer, H.
Publicado: (2024)

Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-based Reformulation
por: Bai, Xiaoning, et al.
Publicado: (2024)

Proximal Limited-Memory Quasi-Newton Methods for Nonsmooth Nonconvex Optimization
por: Dahl, Simeon vom, et al.
Publicado: (2026)

PANOC-lite: A simpler and more efficient algorithm for composite minimization
por: Bodard, Alexander, et al.
Publicado: (2026)

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
por: Ang, Andersen, et al.
Publicado: (2023)

Nonsmooth Convex Optimization using the Specular Gradient Method with Root-Linear Convergence
por: Jung, Kiyuob, et al.
Publicado: (2024)

Randomized block proximal method with locally Lipschitz continuous gradient
por: Pérez-Aros, Pedro, et al.
Publicado: (2025)

Semi-analytical Approach to Trajectory Optimization for Stacker Cranes Regarding Energy Saving
por: Zöllner, R., et al.
Publicado: (2025)