Convergence of diagonally stationary sequences in convex optimization
From MaRDI portal
Publication:1332534
DOI10.1007/BF01027092zbMath0810.65055OpenAlexW1979854129MaRDI QIDQ1332534
Publication date: 9 April 1995
Published in: Set-Valued Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01027092
Related Items
Conditioning and upper-Lipschitz inverse subdifferentials in nonsmooth optimization problems ⋮ Iterative regularization via dual diagonal descent ⋮ Application of the penalty method to nonstationary approximation of an optimization problem ⋮ VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks ⋮ Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods ⋮ Application of penalty methods to non-stationary variational inequalities ⋮ Well-posedness by perturbations of variational problems ⋮ Accelerated Iterative Regularization via Dual Diagonal Descent
Cites Work
- Penalty-proximal methods in convex programming
- Well behaved asymptotical convex functions
- Penalization in non-classical convex programming via variational convergence
- Metrically well-set minimization problems
- On equiwellset minimum problems
- Perturbation des méthodes d'optimisation. Applications
- Convex Functions with Unbounded Level Sets and Applications to Duality Theory
- Sur un Procede d’Optimisation Utilisant Simultanement les Methodes de Penalisation et des Variations Locales. I
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Convergence of diagonally stationary sequences in convex optimization