UNLocBoX

swMATH7521MaRDI QIDQ19548FDOQ19548

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Proximal algorithms for multicomponent image recovery problems
• Iterative methods for solving proximal split minimization problems
• A selective linearization method for multiblock convex optimization
• Proximal point algorithms for finding common fixed points of a finite family of quasi-nonexpansive multi-valued mappings in real Hilbert spaces
• Title not available (Why is that?)
• An iterative algorithm for sparse and constrained recovery with applications to divergence-free current reconstructions in magneto-encephalography
• On the zero point problem of monotone operators in Hadamard spaces
• Proximal operator of quotient functions with application to a feasibility problem in query optimization
• Data Assimilation in Reduced Modeling
• Joint sparse recovery based on variances
• On convergence analysis of dual proximal-gradient methods with approximate gradient for a class of nonsmooth convex minimization problems
• A proximal difference-of-convex algorithm with extrapolation
• Iterative algorithms for total variation-like reconstructions in seismic tomography
• Convex minimization problems based on an accelerated fixed point algorithm with applications to image restoration problems
• Maximum-a-posteriori estimation with Bayesian confidence regions
• Shrinking approximants for fixed point problem and generalized split null point problem in Hilbert spaces
• On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds
• A cyclic block coordinate descent method with generalized gradient projections
• Bayesian computation: a summary of the current state, and samples backwards and forwards
• Accelerating \(\ell^1\)-\(\ell^2\) deblurring using wavelet expansions of operators
• Computing proximal points of convex functions with inexact subgradients
• Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions
• Combined first and second order variational approaches for image processing
• Forward-backward quasi-Newton methods for nonsmooth optimization problems
• Supervised nonnegative matrix factorization via minimization of regularized Moreau-envelope of divergence function with application to music transcription
• Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
• Stadium norm and Douglas-Rachford splitting: a new approach to road design optimization
• Sparse time-frequency decomposition based on dictionary adaptation
• Alternating direction method of multipliers for separable convex optimization of real functions in complex variables
• A regularized semi-smooth Newton method with projection steps for composite convex programs
• Adaptive restart of the optimized gradient method for convex optimization
• Exact worst-case convergence rates of the proximal gradient method for composite convex minimization
• On quasi-Newton forward-backward splitting: proximal calculus and convergence
• A proximal point method for the sum of maximal monotone operators
• On the linear convergence of forward-backward splitting method. I: Convergence analysis
• Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
• A parallel proximal splitting method for disparity estimation from multicomponent images under illumination variation
• Convergence of functions and their Moreau envelopes on Hadamard spaces
• On proximal gradient method for the convex problems regularized with the group reproducing kernel norm
• Modified Fejér sequences and applications
• Piecewise-polynomial signal segmentation using convex optimization.
• A conjugate subgradient algorithm with adaptive preconditioning for the least absolute shrinkage and selection operator minimization
• Fully smoothed \(\ell_1\)-\(TV\) models: bounds for the minimizers and parameter choice
• An optimal transport approach for seismic tomography: application to 3D full waveform inversion
• Rate of convergence for proximal point algorithms on Hadamard manifolds
• Low-rank inducing norms with optimality interpretations
• A unified formulation for generalized oilfield development optimization
• The multiproximal linearization method for convex composite problems
• Iterative regularization via dual diagonal descent
• Two-dimensional compact variational mode decomposition
• Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences
• Optimal selection of the regularization function in a weighted total variation model. II: Algorithm, its analysis and numerical tests
• The Shannon total variation
• The adaptive projected subgradient method constrained by families of quasi-nonexpansive mappings and its application to online learning
• Robust and scalable methods for the dynamic mode decomposition
• Stability of over-relaxations for the forward-backward algorithm, application to FISTA
• A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
• Accelerated alternating descent methods for Dykstra-like problems
• Applications of optimal transportation in the natural sciences. Abstracts from the workshop held February 21--27, 2021 (online meeting)
• Duality and Convex Programming
• Robust regression with compositional covariates
• Sensitivity analysis of the proximal-based parallel decomposition methods
• Optimal transport in full-waveform inversion: analysis and practice of the multidimensional Kantorovich-Rubinstein norm
• Peridynamics enabled learning partial differential equations
• A preconditioning technique for first-order primal-dual splitting method in convex optimization
• Generalized Sinkhorn iterations for regularizing inverse problems using optimal mass transport
• RNLp: mixing nonlocal and TV-Lp methods to remove impulse noise from images
• An image reconstruction model regularized by edge-preserving diffusion and smoothing for limited-angle computed tomography
• A splitting primal-dual proximity algorithm for solving composite optimization problems
• Quantization and compressive sensing
• Designing Gabor windows using convex optimization
• The distance between convex sets with Minkowski sum structure: application to collision detection
• Higher-order total variation approaches and generalisations
• Adaptive FISTA for Nonconvex Optimization
• Optical flow
• Multi-step inertial Krasnosel'skiǐ-Mann iteration with new inertial parameters arrays
• Title not available (Why is that?)
• Variable metric techniques for forward-backward methods in imaging
• A parallel operator splitting algorithm for solving constrained total-variation retinex
• Single-forward-step projective splitting: exploiting cocoercivity
• Fast Mumford-Shah two-phase image segmentation using proximal splitting scheme
• On the equivalence of the primal-dual hybrid gradient method and Douglas-Rachford splitting
• Strong convergence of a forward-backward splitting method with a new step size for solving monotone inclusions
• Contrast invariant SNR and isotonic regressions
• Strongly convex optimization for joint fractal feature estimation and texture segmentation
• Variational regularization of the weighted conical Radon transform
• Proximal gradient methods with adaptive subspace sampling
• A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression
• Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
• Analysis of optimization algorithms via integral quadratic constraints: nonstrongly convex problems
• Dynamical systems coupled with monotone set-valued operators: formalisms, applications, well-posedness, and stability
• A block coordinate variable metric linesearch based proximal gradient method
• Convolutional proximal neural networks and plug-and-play algorithms
• An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems
• Forward-backward-half forward dynamical systems for monotone inclusion problems with application to v-GNE
• Kalman-based stochastic gradient method with stop condition and insensitivity to conditioning
• Automated data-driven selection of the hyperparameters for total-variation-based texture segmentation
• Sparse group fused Lasso for model segmentation: a hybrid approach
• A modified proximal point algorithm for a nearly asymptotically quasi-nonexpansive mapping with an application
• A modified proximal point algorithm involving nearly asymptotically quasi-nonexpansive mappings

This page was built for software: UNLocBoX