scientific article; zbMATH DE number 3296905

Cited in

(only showing first 100 items - show all)

A primal-dual perspective of online learning algorithms
Sketching information divergences
Bregman divergences in the (m k)-partitioning problem
Bregman distances and Klee sets
Leveraging mixed and incomplete outcomes via reduced-rank modeling
A relaxed version of Bregman's method for convex programming
The projection method for solving nonlinear systems of equations under the most violated constraint control
A long range forestry planning problem with multiple objectives
An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems
On some optimization techniques in image reconstruction from projections
Parallel application of block-iterative methods in medical imaging and radiation therapy
An iterative row-action method for interval convex programming
On some methods for entropy maximization and matrix scaling
Progressive regularization of variational inequalities and decomposition algorithms
An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems
Error bounds and convergence analysis of feasible descent methods: A general approach
On the convergence of the coordinate descent method for convex differentiable minimization
New iterative methods for linear inequalities
Proximal minimization algorithm with \(D\)-functions
The weighted majority algorithm
Data parallel computing for network-structured optimization problems
A row-action method for convex programming
A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem
Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces
A multiprojection algorithm using Bregman projections in a product space
Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
An interior point method for the nonlinear complementarity problem
Equilibrium programming using proximal-like algorithms
On some properties of generalized proximal point methods for variational inequalities
Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
An MM Algorithm for Split Feasibility Problems
Approximation of linear programs by Bregman's \(D_F\) projections
Adaptive and self-confident on-line learning algorithms
Relative expected instantaneous loss bounds
Generalized equilibrium and fixed point problems for Bregman relatively nonexpansive mappings in Banach spaces
The logarithmic super divergence and asymptotic inference properties
Riemannian game dynamics
Optimal Bayesian minimax rates for unconstrained large covariance matrices
A non-interior continuation algorithm for solving the convex feasibility problem
Comparison of minimization methods for nonsmooth image segmentation
A simplified view of first order methods for optimization
Note on the modified relaxation CQ algorithm for the split feasibility problem
Estimation and empirical performance of non-scalar dynamic conditional correlation models
Supervised nonnegative matrix factorization via minimization of regularized Moreau-envelope of divergence function with application to music transcription
Stochastic mirror descent method for distributed multi-agent optimization
Approximation of common fixed points of nonlinear mappings satisfying jointly demi-closedness principle in Banach spaces
Accelerated schemes for a class of variational inequalities
A conjugate gradient like method for p-norm minimization in functional spaces
Distortion risk measures, ROC curves, and distortion divergence
A multi-objective interpretation of optimal transport
Convergence theorems for right Bregman strongly nonexpansive mappings in reflexive Banach spaces
Conditions on shifted passivity of port-Hamiltonian systems
Mini-workshop: Deep learning and inverse problems. Abstracts from the mini-workshop held March 4--10, 2018
A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem
Secant and Popov-like conditions in power network stability
Modification of TV-ROF denoising model based on split Bregman iterations
Noise-tolerance matrix completion for location recommendation
The general split equality problem for Bregman quasi-nonexpansive mappings in Banach spaces
Existence and convergence theorems for Bregman best proximity points in reflexive Banach spaces
A perturbative picture of cubic tensors in dually flat spaces
Exponentially concave functions and a new information geometry
Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces
Dual scaling of comparison and reference stimuli in multi-dimensional psychological space
Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization
An optimal randomized incremental gradient method
Diagonality measures of Hermitian positive-definite matrices with application to the approximate joint diagonalization problem
Proximal algorithms in statistics and machine learning
On the unification of possibilistic fuzzy clustering: axiomatic development and convergence analysis
Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
Mirror descent and nonlinear projected subgradient methods for convex optimization.
Summed squared distance error reduction by simultaneous multiprojections and applications
Some recent advances in projection-type methods for variational inequalities
Duality for Bregman projections onto translated cones and affine subspaces.
Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory
Statistical behavior and consistency of classification methods based on convex risk minimization.
Some properties of generalized proximal point methods for quadratic and linear programming
Generalized projections for non-negative functions
Finding the common point of a system of convex sets and solving mathematical-programming optimization problems by the orthogonal descent method
Application of the combined relaxation method to find equilibrium points of quasi-concave-convex functions
Primal-dual row-action method for convex programming
Density-ratio matching under the Bregman divergence: a unified framework of density-ratio estimation
Entropy programming modeling of IBNR claims reserves
Monotonically convergent algorithms for symmetric tensor approximation
An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems
Dual norm based iterative methods for image restoration
A generalized univariate Newton method motivated by proximal regularization
An interior proximal method for a class of quasimonotone variational inequalities
Relationships between the Legendre structure in the \(S_{2-q}\)-formalism and the dually-flat structure in the space of escort distributions
Error forgetting of Bregman iteration
Bregmanized domain decomposition for image restoration
Higher-order TV methods -- enhancement via Bregman iteration
Accelerated linearized Bregman method
Alternating minimization as sequential unconstrained minimization: a survey
High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
An extension of the proximal point algorithm with Bregman distances on Hadamard manifolds
Cost-sensitive learning based on Bregman divergences
Hyperlink regression via Bregman divergence
On the shrinking projection method for the split feasibility problem in Banach spaces
Inertial alternating generalized forward-backward splitting for image colorization

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5580053)