Perturbation des méthodes d'optimisation. Applications
From MaRDI portal
Publication:4158829
DOI10.1051/m2an/1978120201531zbMath0379.90088OpenAlexW2587712072MaRDI QIDQ4158829
Publication date: 1978
Published in: RAIRO. Analyse numérique (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/193317
Related Items
Convergence of diagonally stationary sequences in convex optimization ⋮ Equilibrium programming using proximal-like algorithms ⋮ Theoretical aspect of diagonal Bregman proximal methods ⋮ An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities ⋮ An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming ⋮ Inexact version of Bregman proximal gradient algorithm ⋮ Inexact accelerated high-order proximal-point methods ⋮ Iterative regularization via dual diagonal descent ⋮ A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors ⋮ Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming ⋮ Proximal-like algorithm using the quasi D-function for convex second-order cone programming ⋮ A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem ⋮ Ishikawa iterative algorithms for a generalized equilibrium problem and fixed point problems of a pseudo-contraction mapping ⋮ Interior proximal methods and central paths for convex second-order cone programming ⋮ Strong convergence theorems of iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems ⋮ Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming ⋮ A general iterative method for variational inequality problems, mixed equilibrium problems, and fixed point problems of strictly pseudocontractive mappings in Hilbert spaces ⋮ Strong convergence of the iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems of an infinite family of nonexpansive mappings ⋮ Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization ⋮ Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure
Cites Work
- The multiplier method of Hestenes and Powell applied to convex programming
- A method of feasible directions using function approximations, with applications to min max problems
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Perturbation des méthodes d'optimisation. Applications
