Cover Image

Nonlinear tomographic reconstruction via nonsmooth optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Charisopoulos, Vasileios, Willett, Rebecca
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Numerical Analysis 65K10, 90C06
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Faster Adaptive Optimization via Expected Gradient Outer Product Reparameterization
by: DePavia, Adela, et al.
Published: (2025)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
by: Deng, Kangkang, et al.
Published: (2025)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
by: Deng, Kangkang, et al.
Published: (2024)

ASPEN: An Additional Sampling Penalty Method for Finite-Sum Optimization Problems with Nonlinear Equality Constraints
by: Krejić, Nataša, et al.
Published: (2025)

Convergence analysis of a primal-dual optimization-by-continuation algorithm
by: Loris, Ignace, et al.
Published: (2023)

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

Monomial barrier functions for the box-constrained convex optimization problems
by: Fayed, Hatem
Published: (2024)

Adaptive Preconditioned Gradient Descent with Energy
by: Liu, Hailiang, et al.
Published: (2023)

Technical results on the convergence of quasi-Newton methods for nonsmooth optimization
by: Gebken, Bennet
Published: (2025)

Greedy Learning to Optimize with Convergence Guarantees
by: Fahy, Patrick, et al.
Published: (2024)

On the role of semismoothness in the implicit programming approach to selected nonsmooth optimization problems
by: Gfrerer, Helmut, et al.
Published: (2024)

Error estimate for regularized optimal transport problems via Bregman divergence
by: Morikuni, Keiichi, et al.
Published: (2023)

Discovering new phases via computing second-order stationary states of Landau-Brazovskii model
by: Bao, Chenglong, et al.
Published: (2026)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
by: Bao, Chenglong, et al.
Published: (2024)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
by: Bao, Chenglong, et al.
Published: (2023)

A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
by: Zeng, Hanfeng, et al.
Published: (2026)

Swarm-based optimization with random descent
by: Tadmor, Eitan, et al.
Published: (2023)

On the role of semismoothness in nonsmooth numerical analysis: Theory
by: Gfrerer, H., et al.
Published: (2024)

Spectral conjugate gradient projection methods for large-scale monotone equations without Lipschitz continuity
by: Hamiss, Kabenge, et al.
Published: (2026)

A Trust Region Proximal Gradient Method for Nonlinear Multi-objective Optimization Problems
by: Ansary, Md Abu Talhamainuddin
Published: (2024)

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
by: Zhou, Yingxin, et al.
Published: (2025)

Swarm-based optimization with jumps: a kinetic BGK framework and convergence analysis
by: Borghi, Giacomo, et al.
Published: (2025)

Randomized subspace correction methods for convex optimization
by: Jiang, Boou, et al.
Published: (2025)

A stochastic subspace approach to gradient-free optimization in high dimensions
by: Kozak, David, et al.
Published: (2020)

A preconditioned difference of convex functions algorithm with extrapolation and line search
by: Zhang, Ran, et al.
Published: (2025)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
by: Mannel, Florian
Published: (2024)

Gradient descent with adaptive stepsize converges (nearly) linearly under fourth-order growth
by: Davis, Damek, et al.
Published: (2024)

A Globally Convergent Third-Order Newton Method via Unified Semidefinite Programming Subproblems
by: Cai, Yubo, et al.
Published: (2026)

A novel numerical method tailored for unconstrained optimization problems
by: Li, Lin, et al.
Published: (2025)

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

An adaptive framework for first-order gradient methods
by: Hu, Xiaozhe, et al.
Published: (2026)

Preconditioned subgradient method for composite optimization: overparameterization and fast convergence
by: Díaz, Mateo, et al.
Published: (2025)

EnKSGD: A Class Of Preconditioned Black Box Optimization And Inversion Algorithms
by: Irwin, Brian, et al.
Published: (2023)

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
by: Monteiro, Renato D. C., et al.
Published: (2024)

Projected Newton method for large-scale Bayesian linear inverse problems
by: Li, Haibo
Published: (2024)

A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction
by: Milzarek, Andre, et al.
Published: (2022)

Swarm-based gradient descent meets simulated annealing
by: Ding, Zhiyan, et al.
Published: (2024)

Swarm-Based Gradient Descent Method for Non-Convex Optimization
by: Lu, Jingcheng, et al.
Published: (2022)

An accelerated preconditioned proximal gradient algorithm with a generalized Nesterov momentum for PET image reconstruction
by: Lin, Yizun, et al.
Published: (2024)

An accelerated rearrangement method for two-phase composite optimization
by: Kao, Chiu-Yen, et al.
Published: (2026)