On the convergence of Han's method for convex programming with quadratic objective

DOI10.1007/BF01582891zbMath0744.90066MaRDI QIDQ1181736

Alvaro Rodolfo de Pierro, Alfredo Noel Iusem

Publication date: 27 June 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

minimizing strictly convex quadratic functionsparallel projections

Mathematics Subject Classification ID

Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A proximal-based deomposition method for compositions method for convex minimization problems, A row-action method for convex programming, Fundamentals of cone regression, An iterative algorithm for approximating convex minimization problem, A multiprojection algorithm using Bregman projections in a product space, Block-iterative surrogate projection methods for convex feasibility problems, Approximation of common fixed points of an infinite family of nonexpansive mappings in Banach spaces, Strong convergence of a general iterative algorithm for equilibrium problems and variational inequality problems, Primal-dual row-action method for convex programming, Iterative algorithms for solving variational inequalities and fixed point problems for asymptotically nonexpansive mappings in Banach spaces, Distributed Stochastic Approximation with Local Projections, A parallel inexact Newton method for stochastic programs with recourse, The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case, A general iterative method for a finite family of nonexpansive mappings, Strong and weak convergence theorems for an infinite family of nonexpansive mappings and applications, Finding projections onto the intersection of convex sets in hilbert spaces, New iterative approximation methods for a countable family of nonexpansive mappings in Banach spaces, A Distributed Boyle--Dykstra--Han Scheme, How good are projection methods for convex feasibility problems?, Unnamed Item, Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces., Dykstras algorithm with bregman projections: A convergence proof, The general iterative methods for nonexpansive mappings in Banach spaces, Two-step viscosity approximation scheme for variational inequality in Banach spaces, Cyclic projection methods on a class of nonconvex sets, Strong convergence of a general iterative method for variational inequality problems and fixed point problems in Hilbert spaces, A general iterative method for an infinite family of nonexpansive mappings, Strong convergence of a modified iterative algorithm for mixed-equilibrium problems in Hilbert spaces, Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings, Quadratic optimization of fixed points of nonexpansive mappings in hubert space, Strong convergence of a self-adaptive method for the split feasibility problem, A decomposition method for convex minimization problems and its application., Equivalent theorems of the convergence between Ishikawa-Halpern iteration and viscosity approximation method, Strong convergence of the modified Ishikawa iterative method for infinitely many nonexpansive mappings in Banach spaces, Computational acceleration of projection algorithms for the linear best approximation problem, Strong convergence of an iterative algorithm on an infinite countable family of nonexpansive mappings, Unnamed Item, Iterative algorithms for finding common solutions of variational inequalities and systems of equilibrium problems and fixed points of families and semigroups of nonexpansive mappings, Some results on non-expansive mappings and relaxed cocoercive mappings in Hilbert spaces, Strong convergence theorems for an infinite family of nonexpansive mappings in Banach spaces, A general iterative method for solving the variational inequality problem and fixed point problem of an infinite family of nonexpansive mappings in Hilbert spaces, Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions, The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem, Metric-Constrained Optimization for Graph Clustering Algorithms, Random test problems and parallel methods for quadratic programs and quadratic stochastic programs^∗

Cites Work

• Unnamed Item
• Relaxed outer projections, weighted averages and convex feasibility
• A simultaneous projections method for linear inequalities
• Convergence results for an accelerated nonlinear Cimmino algorithm
• A successive projection method
• Proximity Maps for Convex Sets
• Decomposition through formalization in a product space
• A Simultaneous Iterative Method for Computing Projections on Polyhedra
• A Parallel Algorithm for a Class of Convex Programs
• Extensions of Hildreth’s Row-Action Method for Quadratic Programming
• Convex Analysis
• The method of projections for finding the common point of convex sets