Pages that link to "Item:Q751770"
From MaRDI portal
The following pages link to Multiplicative iterative algorithms for convex programming (Q751770):
Displaying 26 items.
- A proximal method with logarithmic barrier for nonlinear complementarity problems (Q280087) (← links)
- A class of primal affine scaling algorithms (Q427024) (← links)
- An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming (Q616787) (← links)
- Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization. (Q703163) (← links)
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming (Q925232) (← links)
- Proximal-like algorithm using the quasi D-function for convex second-order cone programming (Q937140) (← links)
- Proximal minimization algorithm with \(D\)-functions (Q1321192) (← links)
- A multiprojection algorithm using Bregman projections in a product space (Q1344108) (← links)
- Equilibrium programming using proximal-like algorithms (Q1373724) (← links)
- On the convergence of multiplicative iterative algorithms with inexact line search (Q1375334) (← links)
- Approximation of linear programs by Bregman's \(D_F\) projections (Q1584816) (← links)
- Some properties of generalized proximal point methods for quadratic and linear programming (Q1896573) (← links)
- An interior point multiplicative method for optimization under positivity constraints (Q1897269) (← links)
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (Q1924060) (← links)
- An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems (Q2701420) (← links)
- A proximal point algorithm with a ϕ-divergence for quasiconvex programming (Q2786322) (← links)
- EM Algorithms (Q2789805) (← links)
- Generalized Proximal Distances for Bilevel Equilibrium Problems (Q2796800) (← links)
- The Legendre Transformation in Modern Optimization (Q2957720) (← links)
- Proximal Methods with Penalization Effects in Banach Spaces (Q3157819) (← links)
- Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization (Q4351184) (← links)
- Newton-type Methods with Generalized Distances For Constrained Optimization (Q4361042) (← links)
- Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant (Q5093643) (← links)
- Multiplicative Algorithms for Maximum Penalized Likelihood Inversion with Non Negative Constraints and Generalized Error Distributions (Q5484670) (← links)
- Dual convergence of the proximal point method with Bregman distances for linear programming (Q5758227) (← links)
- Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm (Q6160427) (← links)