An iterative row-action method for interval convex programming
From MaRDI portal
Publication:1138236
DOI10.1007/BF00934676zbMath0431.49042MaRDI QIDQ1138236
Publication date: 1981
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
entropy optimization; image reconstruction from projections; large and sparse matrices; nonorthogonal projections; interval convex programming
90C25: Convex programming
65G30: Interval and finite arithmetic
90C55: Methods of successive quadratic programming type
Related Items
Asymptotic Behavior of Relatively Nonexpansive Operators in Banach Spaces, Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization, On a proximal point method for convex optimization in banach spaces, Weak Convergence of Orbits of Nonlinear Operators in Reflexive Banach Spaces, ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES, Non-Convex feasibility problems and proximal point methods, A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗, PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS, Interval underrelaxed bregman's method with an application, Operator splittings, Bregman methods and frame shrinkage in image processing, An algorithm for maximum entropy image reconstruction from noisy data, A projection method for solving nonlinear problems in reflexive Banach spaces, A unified primal-dual algorithm framework based on Bregman iteration, A row relaxation method for large minimax problems, Optimization of Burg's entropy over linear constraints, Interval-constrained matrix balancing, The primal-dual algorithm as a constraint-set-manipulation device, Some new multiplicative algorithms for image reconstruction from projections, Proximal-like algorithm using the quasi D-function for convex second-order cone programming, Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces, Removing multiplicative noise by Douglas-Rachford splitting methods, On some algorithms in Banach spaces finding fixed points of nonlinear mappings, A relaxed version of Bregman's method for convex programming, On some optimization techniques in image reconstruction from projections, Parallel application of block-iterative methods in medical imaging and radiation therapy, Dual coordinate step methods for linear network flow problems, On some methods for entropy maximization and matrix scaling, Scalings of matrices satisfying line-product constraints and generalizations, 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, A model for portfolio management with mortgage-backed securities, On the convergence of the coordinate descent method for convex differentiable minimization, Proximal minimization algorithm with \(D\)-functions, Data parallel computing for network-structured optimization problems, 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, A proximal point algorithm for minimax problems, Generalized Bregman projections in convex feasibility problems, Subgradient method with entropic projections for convex nondifferentiable minimization, Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces., Approximation of linear programs by Bregman's \(D_F\) projections, Adaptive and self-confident on-line learning algorithms, Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces, Mirror descent and nonlinear projected subgradient methods for convex optimization., The adventures of a simple algorithm, Duality for Bregman projections onto translated cones and affine subspaces., A parallel relaxation method for quadratic programming problems with interval constraints, Asynchronous gradient algorithms for a class of convex separable network flow problems, Solving multistage stochastic network programs on massively prallel computers, Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs, A survey on the continuous nonlinear resource allocation problem, Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces, A primal-dual iterative algorithm for a maximum likelihood estimation problem, Dykstras algorithm with bregman projections: A convergence proof, Existence and Approximation of Fixed Points of Bregman Firmly Nonexpansive Mappings in Reflexive Banach Spaces, Generalized proximal point algorithms for multiobjective optimization problems, The General Form of γ-Family of Quantum Relative Entropies, Two Strong Convergence Theorems for a Proximal Method in Reflexive Banach Spaces, On Block-Iterative Entropy Maximization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
