Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization
From MaRDI portal
convex programmingfixed pointouter approximationconstrained minimizationconvex feasibility problemreflexive Banach spaceuniformly convex functioncutting planeinconsistent constraintsblock-iterative approximationprojection onto an intersection of convex setssurrogate cut
Numerical mathematical programming methods (65K05) Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) General theory of numerical analysis in abstract spaces (65J05) Decomposition methods (49M27)
Recommendations
- On the convergence of a class of outer approximation algorithms for convex programs
- An Outer Approximation Method for the Variational Inequality Problem
- Block-iterative subgradient projection algorithms for the convex feasibility problem
- From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation
- Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces
Cited in
(39)- A general composite algorithm for solving general equilibrium problems and fixed point problems in Hilbert spaces
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
- Hybrid extragradient iterative algorithms for variational inequalities, variational inclusions, and fixed-point problems
- Construction of best Bregman approximations in reflexive Banach spaces
- Minimization of equilibrium problems, variational inequality problems and fixed point problems
- A finitely convergent circumcenter method for the convex feasibility problem
- Nonlinear forward-backward splitting with projection correction
- Outer approximation schemes for generalized semi-infinite variational inequality problems
- Some characterizations of error bound for non-lower semicontinuous functions
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- A strongly convergent primal-dual method for nonoverlapping domain decomposition
- Composite algorithms for minimization over the solutions of equilibrium problems and fixed point problems
- Proximal primal-dual best approximation algorithm with memory
- Some new extragradient-like methods for generalized equilibrium problems, fixed point problems and variational inequality problems
- Incorporating multiple a priori information for inverse problem by inexact scaled gradient projection
- New outer proximal methods for solving variational inequality problems
- Reconstruction of functions from prescribed proximal points
- Metric subregularity for nonclosed convex multifunctions in normed spaces
- Characterizations for strong Abadie constraint qualification and applications to calmness
- New results related to cutters and to an extrapolated block-iterative method for finding a common fixed point of a collection of them
- On the convergence of a class of outer approximation algorithms for convex programs
- Multivariate Monotone Inclusions in Saddle Form
- A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization
- Outer approximation scheme for weakly convex constrained optimization problems
- Best approximation from the Kuhn-Tucker set of composite monotone inclusions
- Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
- scientific article; zbMATH DE number 2182581 (Why is no real title available?)
- Viscosity inexact projection methods with applications to electricity production models
- New viscosity-projection methods for solving variational inquality problems with applications to image restoration problems
- Complexity of linear minimization and projection on some sets
- Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space
- Outer perturbations of a projection method and two approximation methods for the split equality problem
- Regularized learning schemes in feature Banach spaces
- Two Strong Convergence Theorems for a Proximal Method in Reflexive Banach Spaces
- Scenario approximation of robust and chance-constrained programs
- Parallel Block-Iterative Reconstruction Algorithms for Binary Tomography
- A generalized block-iterative projection method for the common fixed point problem induced by cutters
- WAVELET-CONSTRAINED IMAGE RESTORATION
- Consistent learning by composite proximal thresholding
This page was built for publication: Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943734)
