A subgradient-like algorithm for solving vector convex inequalities

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

zbMATH Keywords

strong convergenceprojection methodssubgradient algorithmvector convex functions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48)

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

• scientific article; zbMATH DE number 3515263 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• A Mesh-Independence Principle for Operator Equations and Their Discretizations
• A Strongly Convergent Direct Method for Monotone Variational Inequalities in Hilbert Spaces
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• A strongly convergent method for nonsmooth convex minimization in Hilbert spaces
• A vector variational inequality and optimization over an efficient set
• Application of the Mesh Independence Principle to Mesh Refinement Strategies
• Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems
• Block-Iterative Algorithms with Underrelaxed Bregman Projections
• Convergence of direct methods for paramonotone variational inequalities
• Convergence of the projected gradient method for quasiconvex multiobjective optimization
• Convex vector functions and their subdifferential
• Forcing strong convergence of proximal point iterations in a Hilbert space
• Functional Operators (AM-22), Volume 2
• Functional analysis, Sobolev spaces and partial differential equations
• Introduction to the Theory of Nonlinear Optimization
• Iterative Algorithms for Equilibrium Problems
• Minimization of unsmooth functionals
• Newton's Mesh Independence Principle for a Class Of Optimal Shape Design Problems
• On Projection Algorithms for Solving Convex Feasibility Problems
• On the choice of parameters for the weighting method in vector optimization
• On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
• Reconstruction of pictures from their projections
• Scalarization in vector optimization
• Scalarization of vector optimization problems
• System modelling and optimization. Proceedings of the 16th IFIP-TC7 conference, Compiègne, France, July 5-9, 1993
• Vector optimization problems and their solution concepts

Cited in

(6)

• scientific article; zbMATH DE number 3858859 (Why is no real title available?)
• On inexact projected gradient methods for solving variable vector optimization problems
• A proximal gradient splitting method for solving convex vector optimization problems
• Subgradient algorithm for computing contraction metrics for equilibria
• Subgradient algorithms for solving variable inequalities
• A strongly convergent proximal point method for vector optimization

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)