scientific article; zbMATH DE number 1382772
From MaRDI portal
zbMath0945.90064MaRDI QIDQ4718793
Yair Censor, Stavros A. Zenios
Publication date: 4 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parallel algorithmsinterior point algorithmsparallel optimizationiterative projection algorithmslarge-scale constrained optimizationmodel decomposition algorithms
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Duality for Bregman projections onto translated cones and affine subspaces., Finding a best approximation pair of points for two polyhedra, Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory, Parallel algorithms for variational inclusions and fixed points with applications, On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces, Han-type algorithms for inconsistent systems of linear inequalities -- a unified approach, A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space, Estimation of asset demands by heterogeneous agents, A projection method for semidefinite linear systems and its applications, Steered sequential projections for the inconsistent convex feasibility problem, The combination projection method for solving convex feasibility problems, Weak convergence of a Mann-like algorithm for nonexpansive and accretive operators, The MIN PFS problem and piecewise linear model estimation, Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings, Supplementary projections for the acceleration of Kaczmarz algorithm, Single-projection procedure for linear optimization, Some convergence strategies for the alternating generalized projection method, Single projection Kaczmarz extended algorithms, Perturbed projections and subgradient projections for the multiple-sets split feasibility problem, Constraint consensus methods for finding strictly feasible points of linear matrix inequalities, Convergence theorems of solutions of a generalized variational inequality, Subgradient projection algorithms and approximate solutions of convex feasibility problems, Restricted normal cones and the method of alternating projections: applications, Restricted normal cones and the method of alternating projections: theory, Adaptive regularization of weight vectors, Differential evolution with multi-constraint consensus methods for constrained optimization, A classification of methods for distributed system optimization based on formulation structure, Approximation accuracy, gradient methods, and error bound for structured convex optimization, A model for designing callable bonds and its solution using tabu search, Adaptive block coordinate DIRECT algorithm, Linear and strong convergence of algorithms involving averaged nonexpansive operators, Common fixed points of a family of strictly pseudocontractive mappings, Dualization of signal recovery problems, Restricted normal cones and sparsity optimization with affine constraints, Operator splittings, Bregman methods and frame shrinkage in image processing, Convergence and perturbation resilience of dynamic string-averaging projection methods, Relaxation methods for solving linear inequality systems: converging results, Constraint consensus methods for finding interior feasible points in second-order cones, Pegasos: primal estimated sub-gradient solver for SVM, On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints, Alternating minimization as sequential unconstrained minimization: a survey, Convergence analysis of processes with valiant projection operators in Hilbert space, Convex feasibility modeling and projection methods for sparse signal recovery, Convergence of a proximal point algorithm for solving minimization problems, Survey on distance metric learning and dimensionality reduction in data mining, Right Bregman nonexpansive operators in Banach spaces, Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems, A system of generalized mixed equilibrium problems and fixed point problems for pseudocontractive mappings in Hilbert spaces, Common solutions to variational inequalities, Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces., On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms, Finite convergence of a subgradient projections method with expanding controls, On Kaczmarz's projection iteration as a direct solver for linear least squares problems, Projection and proximal point methods: Convergence results and counterexamples., Algorithms for the split variational inequality problem, The method of alternating relaxed projections for two nonconvex sets, The convergence of the block cyclic projection with an overrelaxation parameter for compressed sensing based tomography, Convergence studies on block iterative algorithms for image reconstruction, Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods, Hyperlink regression via Bregman divergence, Scenario modelling for selective hedging strategies, Convergence analysis for column-action methods in image reconstruction, A two-factor, stochastic programming model of Danish mortgage-backed securities, The \(\ell_1\) solution of linear inequalities, A coordinate gradient descent method for nonsmooth separable minimization, A relaxation method for solving systems with infinitely many linear inequalities, An efficient simultaneous method for the constrained multiple-sets split feasibility problem, Approximation of common solutions to system of mixed equilibrium problems, variational inequality problem, and strict pseudo-contractive mappings, Reflection-projection method for convex feasibility problems with an obtuse cone, Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces, The asymptotic behavior of the composition of two resolvents, Klee sets and Chebyshev centers for the right Bregman distance, On a generalized proximal point method for solving equilibrium problems in Banach spaces, Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy, A generalized projection-based scheme for solving convex constrained optimization problems, Acceleration of sequential subspace optimization in Banach spaces by orthogonal search directions, The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets, On the unification of possibilistic fuzzy clustering: axiomatic development and convergence analysis, An MM Algorithm for Split Feasibility Problems, Subgradient projection algorithms for convex feasibility problems in the presence of computational errors, A primal-dual perspective of online learning algorithms, Optimal rates of convergence for sparse covariance matrix estimation, A hybrid algorithm for solving linear inequalities in a least squares sense, Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization, Dynamic models for fixed-income portfolio management under uncertainty, Bregman distances and Klee sets, Bregman distances and Chebyshev sets, A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems, A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin, Compositions and convex combinations of Bregman weakly relatively nonexpansive operators in reflexive Banach spaces, Newton's method for linear inequality systems, Viscosity approximation methods for generalized equilibrium problems and fixed point problems with applications, Nonlinear proximal decomposition method for convex programming, Summed squared distance error reduction by simultaneous multiprojections and applications, An inverse treatment planning model for intensity modulated radiation therapy with dynamic MLC, The adventures of a simple algorithm, Adaptive and self-confident on-line learning algorithms, Parallel interior-point method for linear and quadratic programs with special structure, Extropy: complementary dual of entropy, A class of optimized row projection methods for solving large nonsymmetric linear systems, Proximal Methods with Penalization Effects in Banach Spaces, Opial-Type Theorems and the Common Fixed Point Problem, Proximal Splitting Methods in Signal Processing, Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings, Application of Quasi-Nonexpansive Operators to an Iterative Method for Variational Inequality, Constraining by a family of strictly nonexpansive idempotent functions with applications in image reconstruction, Improved constraint consensus methods for seeking feasibility in nonlinear programs, Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds, The Method of Cyclic Intrepid Projections: Convergence Analysis and Numerical Experiments, PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS, NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING, Decomposition Methods for Sparse Matrix Nearness Problems, A hybrid Kaczmarz-conjugate gradient algorithm for image reconstruction, An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces, Unnamed Item, On coupled Boltzmann transport equation related to radiation therapy, Limits of eventual families of sets with application to algorithms for the common fixed point problem, Regularizing with Bregman--Moreau Envelopes, Metrics induced by Jensen-Shannon and related divergences on positive definite matrices, A real-time iterative projection scheme for solving the common fixed point problem and its applications, Optimization of triangular networks with spatial constraints, Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant, Convergence rates for Kaczmarz-type algorithms, Strong convergence of alternating projections, A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators, Stable Convergence Theorems for Infinite Products and Powers of Nonexpansive Mappings, Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems, Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces, How good are projection methods for convex feasibility problems?, Kaczmarz's anomaly: a surprising feature of Kaczmarz's method, The Convergence of a Levenberg–Marquardt Method for Nonlinear Inequalities, Optimal minimal variation control with quality constraint for fed-batch fermentation processes involving multiple feeds, Unsupervised assignment flow: label learning on feature manifolds by spatially regularized geometric assignment, Bregman three-operator splitting methods, Re-examination of Bregman functions and new properties of their divergences, On the incomplete oblique projections method for solving box constrained least squares problems, Column-oriented algebraic iterative methods for nonnegative constrained least squares problems, A survey on the continuous nonlinear resource allocation problem, Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples, Choosing the relaxation parameter in sequential block-iterativemethods for linear systems, Improving solver success in reaching feasibility for sets of nonlinear constraints, The Generalized Bregman Distance, Asset and liability modelling for participating policies with guarantees, An explicit algorithm for solving monotone variational inequalities, Incomplete oblique projections for solving large inconsistent linear systems, PRICING SOVEREIGN CONTINGENT CONVERTIBLE DEBT, Block‐iterative algorithms, On the string averaging method for sparse common fixed‐point problems, Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections, Iterative approximation to convex feasibility problems in Banach space, A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy, Optimal control model for radiation therapy inverse planning applying the Boltzmann transport equation, Incomplete alternating projection method for large inconsistent linear systems, On linear infeasibility arising in intensity-modulated radiation therapy inverse planning, The application of an oblique-projected Landweber method to a model of supervised learning, Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems, Projected subgradient minimization versus superiorization, The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle, Strong convergence theorems for common solutions of a family of nonexpansive mappings and an accretive operator, Convergent Lagrangian heuristics for nonlinear minimum cost network flows, An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem, Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures, Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces, Extrapolation algorithm for affine-convex feasibility problems, Computational acceleration of projection algorithms for the linear best approximation problem, The distance between two convex sets, Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions, New class of multiplicative algorithms for solving of entropy-linear programs, Duality and Convex Programming, Construction of best Bregman approximations in reflexive Banach spaces, Aggregating Large Sets of Probabilistic Forecasts by Weighted Coherent Adjustment, Twenty years of linear programming based portfolio optimization, Weak Convergence of Orbits of Nonlinear Operators in Reflexive Banach Spaces, Nesterov perturbations and projection methods applied to IMRT, An entropic Landweber method for linear ill-posed problems, Bregman forward-backward operator splitting, Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity, Assignment flow for order-constrained OCT segmentation, Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm, Convergence of string-averaging method for a class of operators, Upper and lower bounds for the Bregman divergence, Set-theoretic adaptive filtering based on data-driven sparsification, Approximation Algorithms for Tensor Clustering, Bregman primal-dual first-order method and application to sparse semidefinite programming, Limited recourse in two-stage stochastic linear programs, The finite sample properties of sparse M-estimators with pseudo-observations, Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods, Perturbed iterative methods for a general family of operators: convergence theory and applications, Improved local search algorithms for Bregman \(k\)-means and its variants, Sampled limited memory methods for massive linear inverse problems, Algorithms for the quasiconvex feasibility problem, The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings, A generalized block-iterative projection method for the common fixed point problem induced by cutters, Probability envelopes and their Dempster-Shafer approximations in statistical matching, On Subgradient Projectors, Optimization models for reaction networks: information divergence, quadratic programming and Kirchhoff's laws, Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods, Parallel Block-Iterative Reconstruction Algorithms for Binary Tomography, On the finite convergence of a projected cutter method, Distributed Bregman-Distance Algorithms for Min-Max Optimization, Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization, Can linear superiorization be useful for linear optimization problems?, Envelopes of equivalent martingale measures and a generalized no-arbitrage principle in a finite setting, Credit risk contagion and optimal dual control -- an SIS/R model, On the resolution of cross-liabilities, The method of randomized Bregman projections for stochastic feasibility problems, Addressing ambiguity in randomized reinsurance stop-loss treaties using belief functions, On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra, Strict pseudocontractions and demicontractions, their properties, and applications, The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators, On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces, An iterative method for solving the strong vector equilibrium problem with variable domination structure, Existence and Approximation of Fixed Points of Right Bregman Nonexpansive Operators, String-averaging projected subgradient methods for constrained minimization, Binary steering in discrete tomography reconstruction with sequential and simultaneous iterative algorithms, Bregman Voronoi diagrams, An acceleration scheme for Dykstra's algorithm, Bounded perturbation resilience of projected scaled gradient methods, Unnamed Item, A Hierarchical Presentation of Operators with Fixed Points on Hilbert Spaces, Parallel ART for image reconstruction in CT using processor arrays, Unnamed Item, Regularized Kaczmarz Algorithms for Tensor Recovery
