Iterative approximation for convex optimization problems with operator constraints in a Hilbert space
zbMATH Open1039.90082MaRDI QIDQ5954737FDOQ5954737
Authors: M. R. Davidson, N. M. Novikova 
Publication date: 2000
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Recommendations
- Iterative methods for constrained convex minimization problem in Hilbert spaces
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- Iterative approximation of solutions for constrained convex minimization problem
- scientific article; zbMATH DE number 5310524
- Approximation of solutions to constrained convex minimization problem in Hilbert spaces
- A general approximation method for a kind of convex optimization problems in Hilbert spaces
- A general iterative scheme with applications to convex optimization and related fields
- Iterative schemes for convex minimization problems with constraints
- Iterative algorithm for approximating solutions of maximal monotone operators in Hilbert spaces
- scientific article; zbMATH DE number 3892945
aggregationregularizationconvergenceminimizersolutionconvex optimization problemiterative approximationoperator constraints
Numerical mathematical programming methods (65K05) Numerical methods based on nonlinear programming (49M37) Semi-infinite programming (90C34)
Cited In (8)
- Adaptive Optimization of Convex Functionals in Banach Spaces
- Iterative algorithms for data assimilation problems
- A general approximation method for a kind of convex optimization problems in Hilbert spaces
- Constraint Aggregation in Infinite-Dimensional Spaces and Applications
- Optimization and approximation for polyhedra in separable Hilbert spaces
- Convergence analysis of penalty decomposition algorithm for cardinality constrained convex optimization in Hilbert spaces
- Approximation of solutions to constrained convex minimization problem in Hilbert spaces
- Iteration methods for convexly constrained ill-posed problems in hilbert space
This page was built for publication: Iterative approximation for convex optimization problems with operator constraints in a Hilbert space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954737)
