A subgradient-like algorithm for solving vector convex inequalities
From MaRDI portal
Publication:467438
DOI10.1007/S10957-013-0300-1zbMATH Open1306.90141OpenAlexW2044746947MaRDI QIDQ467438FDOQ467438
Authors: J. Y. Bello Cruz, L. R. Lucambio Pérez 
Publication date: 3 November 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0300-1
Recommendations
- Subgradient algorithms for solving variable inequalities
- The subgradient double projection method for variational inequalities in a Hilbert space
- scientific article; zbMATH DE number 6453350
- The subgradient extragradient method for solving variational inequalities in Hilbert space
- Strong convergence of an inexact projected subgradient method for mixed variational inequalities
Cites Work
- Title not available (Why is that?)
- On Projection Algorithms for Solving Convex Feasibility Problems
- Functional analysis, Sobolev spaces and partial differential equations
- Forcing strong convergence of proximal point iterations in a Hilbert space
- A vector variational inequality and optimization over an efficient set
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Functional Operators (AM-22), Volume 2
- Convergence of direct methods for paramonotone variational inequalities
- Iterative Algorithms for Equilibrium Problems
- Convex vector functions and their subdifferential
- A Mesh-Independence Principle for Operator Equations and Their Discretizations
- Newton's Mesh Independence Principle for a Class Of Optimal Shape Design Problems
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- A strongly convergent method for nonsmooth convex minimization in Hilbert spaces
- A Strongly Convergent Direct Method for Monotone Variational Inequalities in Hilbert Spaces
- Title not available (Why is that?)
- Block-Iterative Algorithms with Underrelaxed Bregman Projections
- Minimization of unsmooth functionals
- Scalarization of vector optimization problems
- Scalarization in vector optimization
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems
- On the choice of parameters for the weighting method in vector optimization
- Vector optimization problems and their solution concepts
- Introduction to the Theory of Nonlinear Optimization
- System modelling and optimization. Proceedings of the 16th IFIP-TC7 conference, Compiègne, France, July 5-9, 1993
- Application of the Mesh Independence Principle to Mesh Refinement Strategies
- Reconstruction of pictures from their projections
Cited In (6)
- A proximal gradient splitting method for solving convex vector optimization problems
- Subgradient algorithms for solving variable inequalities
- On inexact projected gradient methods for solving variable vector optimization problems
- A strongly convergent proximal point method for vector optimization
- Title not available (Why is that?)
- Subgradient algorithm for computing contraction metrics for equilibria
This page was built for publication: A subgradient-like algorithm for solving vector convex inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q467438)
