scientific article; zbMATH DE number 1382772

Publication date: 4 January 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

parallel algorithms interior point algorithms parallel optimization iterative projection algorithms large-scale constrained optimization model decomposition algorithms

Mathematics Subject Classification ID

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 (only showing first 100 items - show all)

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

This page was built for publication: