Perturbation des méthodes d'optimisation. Applications
From MaRDI portal
Publication:4158829
Cites work
- scientific article; zbMATH DE number 3310599 (Why is no real title available?)
- scientific article; zbMATH DE number 3334605 (Why is no real title available?)
- scientific article; zbMATH DE number 3354513 (Why is no real title available?)
- scientific article; zbMATH DE number 3419028 (Why is no real title available?)
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- A method of feasible directions using function approximations, with applications to min max problems
- The multiplier method of Hestenes and Powell applied to convex programming
Cited in
(20)- A general iterative method for variational inequality problems, mixed equilibrium problems, and fixed point problems of strictly pseudocontractive mappings in Hilbert spaces
- A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem
- 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
- Equilibrium programming using proximal-like algorithms
- A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors
- An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming
- Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
- Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
- Convergence of diagonally stationary sequences in convex optimization
- Theoretical aspect of diagonal Bregman proximal methods
- Ishikawa iterative algorithms for a generalized equilibrium problem and fixed point problems of a pseudo-contraction mapping
- Inexact accelerated high-order proximal-point methods
- Inexact high-order proximal-point methods with auxiliary search procedure
- Proximal-like algorithm using the quasi D-function for convex second-order cone programming
- Iterative regularization via dual diagonal descent
- Inexact version of Bregman proximal gradient algorithm
- 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
This page was built for publication: Perturbation des méthodes d'optimisation. Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4158829)
