Multiplicative iterative algorithms for convex programming
From MaRDI portal
Publication:751770
DOI10.1016/0024-3795(90)90204-PzbMath0715.65037OpenAlexW2082305681WikidataQ114852093 ScholiaQ114852093MaRDI QIDQ751770
Publication date: 1990
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(90)90204-p
Related Items (26)
Proximal Methods with Penalization Effects in Banach Spaces ⋮ A proximal method with logarithmic barrier for nonlinear complementarity problems ⋮ A multiprojection algorithm using Bregman projections in a product space ⋮ Some properties of generalized proximal point methods for quadratic and linear programming ⋮ An interior point multiplicative method for optimization under positivity constraints ⋮ Equilibrium programming using proximal-like algorithms ⋮ On the convergence of multiplicative iterative algorithms with inexact line search ⋮ An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities ⋮ Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant ⋮ An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming ⋮ The Legendre Transformation in Modern Optimization ⋮ Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm ⋮ A class of primal affine scaling algorithms ⋮ An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems ⋮ Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization ⋮ Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming ⋮ Newton-type Methods with Generalized Distances For Constrained Optimization ⋮ Proximal-like algorithm using the quasi D-function for convex second-order cone programming ⋮ Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization. ⋮ A proximal point algorithm with a ϕ-divergence for quasiconvex programming ⋮ Dual convergence of the proximal point method with Bregman distances for linear programming ⋮ EM Algorithms ⋮ Generalized Proximal Distances for Bilevel Equilibrium Problems ⋮ Multiplicative Algorithms for Maximum Penalized Likelihood Inversion with Non Negative Constraints and Generalized Error Distributions ⋮ Approximation of linear programs by Bregman's \(D_F\) projections ⋮ Proximal minimization algorithm with \(D\)-functions
Cites Work
This page was built for publication: Multiplicative iterative algorithms for convex programming
