Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization

DOI10.1137/S036301299732626XzbMath1032.90023MaRDI QIDQ4943734

Publication date: 19 March 2000

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

fixed point reflexive Banach space convex programming outer approximation cutting plane constrained minimization convex feasibility problem uniformly convex function inconsistent constraints block-iterative approximation projection onto an intersection of convex sets surrogate cut

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) General theory of numerical analysis in abstract spaces (65J05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Decomposition methods (49M27)

Related Items

Some new extragradient-like methods for generalized equilibrium problems, fixed point problems and variational inequality problems ⋮ Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings ⋮ Outer perturbations of a projection method and two approximation methods for the split equality problem ⋮ Scenario approximation of robust and chance-constrained programs ⋮ Multivariate Monotone Inclusions in Saddle Form ⋮ Minimization of equilibrium problems, variational inequality problems and fixed point problems ⋮ Composite algorithms for minimization over the solutions of equilibrium problems and fixed point problems ⋮ Incorporating multiple a priori information for inverse problem by inexact scaled gradient projection ⋮ New outer proximal methods for solving variational inequality problems ⋮ A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization ⋮ Regularized learning schemes in feature Banach spaces ⋮ Hybrid extragradient iterative algorithms for variational inequalities, variational inclusions, and fixed-point problems ⋮ Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. ⋮ WAVELET-CONSTRAINED IMAGE RESTORATION ⋮ Nonlinear Forward-Backward Splitting with Projection Correction ⋮ Consistent learning by composite proximal thresholding ⋮ Proximal primal-dual best approximation algorithm with memory ⋮ Outer approximation schemes for generalized semi-infinite variational inequality problems ⋮ Two Strong Convergence Theorems for a Proximal Method in Reflexive Banach Spaces ⋮ A general composite algorithm for solving general equilibrium problems and fixed point problems in Hilbert spaces ⋮ Metric subregularity for nonclosed convex multifunctions in normed spaces ⋮ Construction of best Bregman approximations in reflexive Banach spaces ⋮ Best Approximation from the Kuhn-Tucker Set of Composite Monotone Inclusions ⋮ A strongly convergent primal-dual method for nonoverlapping domain decomposition ⋮ Characterizations for strong Abadie constraint qualification and applications to calmness ⋮ Reconstruction of functions from prescribed proximal points ⋮ Complexity of linear minimization and projection on some sets ⋮ Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space ⋮ Some characterizations of error bound for non-lower semicontinuous functions ⋮ A generalized block-iterative projection method for the common fixed point problem induced by cutters ⋮ Parallel Block-Iterative Reconstruction Algorithms for Binary Tomography

This page was built for publication: Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization