An iterative row-action method for interval convex programming
From MaRDI portal
Publication:1138236
DOI10.1007/BF00934676zbMath0431.49042OpenAlexW1984958640MaRDI QIDQ1138236
Publication date: 1981
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00934676
entropy optimizationimage reconstruction from projectionslarge and sparse matricesnonorthogonal projectionsinterval convex programming
Convex programming (90C25) Interval and finite arithmetic (65G30) Methods of successive quadratic programming type (90C55)
Related Items (only showing first 100 items - show all)
Hybrid iterative algorithm for finite families of countable Bregman quasi-Lipschitz mappings with applications in Banach spaces ⋮ Duality for Bregman projections onto translated cones and affine subspaces. ⋮ A hybrid extragradient method for solving pseudomonotone equilibrium problems using Bregman distance ⋮ A strong convergence theorem for solving the split feasibility and fixed point problems in Banach spaces ⋮ Data parallel computing for network-structured optimization problems ⋮ Convergence theorems for maximal monotone operators and fixed point problems in Banach spaces ⋮ Strong convergence theorems for Bregman quasi-strict pseudo-contractions in reflexive Banach spaces with applications ⋮ New hybrid shrinking projection algorithm for common fixed points of a family of countable quasi-Bregman strictly pseudocontractive mappings with equilibrium and variational inequality and optimization problems ⋮ A strong convergence theorem for Bregman asymptotically quasi-nonexpansive mappings in the intermediate sense ⋮ Strong convergence of hybrid Halpern iteration for Bregman totally quasi-asymptotically nonexpansive multi-valued mappings in reflexive Banach spaces with application ⋮ Strong convergence theorem for quasi-Bregman strictly pseudocontractive mappings and equilibrium problems in Banach spaces ⋮ Strong convergence theorems for Bregman \(W\)-mappings with applications to convex feasibility problems in Banach spaces ⋮ Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces ⋮ An algorithm for finding a common point of the solution set of a variational inequality and the fixed point set of a Bregman relatively nonexpansive mapping ⋮ A multiprojection algorithm using Bregman projections in a product space ⋮ An iterative algorithm for solving split feasibility problems and fixed point problems in Banach spaces ⋮ Dual averaging with adaptive random projection for solving evolving distributed optimization problems ⋮ Approximation method for solving fixed point problem of Bregman strongly nonexpansive mappings in reflexive Banach spaces ⋮ Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ Convergence theorems for Bregman \(K\)-mappings and mixed equilibrium problems in reflexive Banach spaces ⋮ A parallel relaxation method for quadratic programming problems with interval constraints ⋮ Note on the modified relaxation CQ algorithm for the split feasibility problem ⋮ Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces ⋮ On some optimization techniques in image reconstruction from projections ⋮ Parallel application of block-iterative methods in medical imaging and radiation therapy ⋮ An interior point method for the nonlinear complementarity problem ⋮ Dual coordinate step methods for linear network flow problems ⋮ A proximal point algorithm for minimax problems ⋮ Asynchronous gradient algorithms for a class of convex separable network flow problems ⋮ Strong convergence theorem for Bregman strongly nonexpansive mappings and equilibrium problems in reflexive Banach spaces ⋮ Solving multistage stochastic network programs on massively prallel computers ⋮ Strong convergence iterative algorithms for equilibrium problems and fixed point problems in Banach spaces ⋮ Generalized Bregman projections in convex feasibility problems ⋮ Subgradient method with entropic projections for convex nondifferentiable minimization ⋮ Approximation of common fixed points of nonlinear mappings satisfying jointly demi-closedness principle in Banach spaces ⋮ Halpern-Mann's iterations for Bregman strongly nonexpansive mappings in reflexive Banach spaces with applications ⋮ Parallel iterative methods for Bregman strongly nonexpansive operators in reflexive Banach spaces ⋮ Convergence results for a common solution of a finite family of variational inequality problems for monotone mappings with Bregman distance function ⋮ Operator splittings, Bregman methods and frame shrinkage in image processing ⋮ A projection method for solving nonlinear problems in reflexive Banach spaces ⋮ On some methods for entropy maximization and matrix scaling ⋮ A unified primal-dual algorithm framework based on Bregman iteration ⋮ Composite iterative schemes for maximal monotone operators in reflexive Banach spaces ⋮ An extension of the proximal point algorithm with Bregman distances on Hadamard manifolds ⋮ Some new multiplicative algorithms for image reconstruction from projections ⋮ Right Bregman nonexpansive operators in Banach spaces ⋮ Approximation of common solutions of nonlinear problems involving various classes of mappings ⋮ Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. ⋮ Applications of Bregman-Opial property to Bregman nonspreading mappings in Banach spaces ⋮ Convergence theorems for right Bregman strongly nonexpansive mappings in reflexive Banach spaces ⋮ Bregman \(f\)-projection operator with applications to variational inequalities in Banach spaces ⋮ Proximal-like algorithm using the quasi D-function for convex second-order cone programming ⋮ Algorithms for a class of bilevel programs involving pseudomonotone variational inequalities ⋮ A new multi-step iterative algorithm for approximating common fixed points of a finite family of multi-valued Bregman relatively nonexpansive mappings ⋮ A modified iterative algorithm for split feasibility problems of right Bregman strongly quasi-nonexpansive mappings in Banach spaces with applications ⋮ Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods ⋮ 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 ⋮ Strong convergence theorem for a system of generalized mixed equilibrium problems and finite family of Bregman nonexpansive mappings in Banach spaces ⋮ Scalings of matrices satisfying line-product constraints and generalizations ⋮ A row relaxation method for large minimax problems ⋮ SOR- and Jacobi-type iterative methods for solving \(\ell_1 - \ell_2\) problems by way of Fenchel duality ⋮ Strong convergence theorems for Bregman totally quasi-asymptotically nonexpansive mappings in reflexive Banach spaces ⋮ Halpern's iteration for Bregman strongly nonexpansive mappings in reflexive Banach spaces ⋮ A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems ⋮ Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces ⋮ Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces ⋮ Bregman asymptotic pointwise nonexpansive mappings in Banach spaces ⋮ An improved Bregman \(k\)-means++ algorithm via local search ⋮ On a generalized proximal point method for solving equilibrium problems in Banach spaces ⋮ Modified inertial subgradient extragradient method in reflexive Banach spaces ⋮ Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization ⋮ An algorithm for maximum entropy image reconstruction from noisy data ⋮ An iterative method for solving minimization, variational inequality and fixed point problems in reflexive Banach spaces ⋮ Strong convergence of a self-adaptive method for the split feasibility problem in Banach spaces ⋮ Removing multiplicative noise by Douglas-Rachford splitting methods ⋮ On the unification of possibilistic fuzzy clustering: axiomatic development and convergence analysis ⋮ Accelerated Bregman proximal gradient methods for relatively smooth convex optimization ⋮ New inertial relaxed method for solving split feasibilities ⋮ An iterative approximation of common solutions of split generalized vector mixed equilibrium problem and some certain optimization problems ⋮ Mirror descent and nonlinear projected subgradient methods for convex optimization. ⋮ Optimization of Burg's entropy over linear constraints ⋮ Interval-constrained matrix balancing ⋮ A Tseng extragradient method for solving variational inequality problems in Banach spaces ⋮ On some algorithms in Banach spaces finding fixed points of nonlinear mappings ⋮ Weak and strong convergence Bregman extragradient schemes for solving pseudo-monotone and non-Lipschitz variational inequalities ⋮ Convergence analysis for variational inequalities and fixed point problems in reflexive Banach spaces ⋮ An interior point method with Bregman functions for the variational inequality problem with paramonotone operators ⋮ Two projection algorithms for solving the split common fixed point problem ⋮ Compositions and convex combinations of Bregman weakly relatively nonexpansive operators in reflexive Banach spaces ⋮ Approximation of linear programs by Bregman's \(D_F\) projections ⋮ Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems ⋮ A model for portfolio management with mortgage-backed securities ⋮ The adventures of a simple algorithm ⋮ A relaxed version of Bregman's method for convex programming ⋮ Adaptive and self-confident on-line learning algorithms ⋮ The primal-dual algorithm as a constraint-set-manipulation device ⋮ On the convergence of the coordinate descent method for convex differentiable minimization ⋮ Proximal minimization algorithm with \(D\)-functions ⋮ Strong convergence results of two-steps modifying Halpern's iteration for Bregman strongly nonexpansive multi-valued mappings in reflexive Banach spaces with application
Cites Work
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- An interval programming algorithm for discrete linear \(L_ 1\) approximation problems
- A suboptimization method for interval linear programming: A new method for linear programming
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Relaxation methods for image reconstruction
- Seven Kinds of Convexity
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An iterative row-action method for interval convex programming