scientific article; zbMATH DE number 895182

Publication date: 1 July 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

gradient methods conjugate gradient methods monotone mappings maximal monotone mappings modified Lagrangian functions convex programming problems weak modified Lagrangian function

Mathematics Subject Classification ID

Convex programming (90C25) Numerical methods involving duality (49M29) Numerical methods based on necessary conditions (49M05) Monotone operators and generalizations (47H05) Existence of solutions for minimax problems (49J35) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02)

Related Items (32)

A quasi-residual principle in regularization for a common solution of a system of nonlinear monotone ill-posed equations ⋮ Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings ⋮ A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints ⋮ Augmented Lagrangian methods for convex matrix optimization problems ⋮ Perturbed projections and subgradient projections for the multiple-sets split feasibility problem ⋮ On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems ⋮ Exact computation of an error bound for the balanced linear complementarity problem with unique solution ⋮ Split monotone variational inclusions ⋮ Common solutions to variational inequalities ⋮ Low-cost modification of Korpelevich's methods for monotone equilibrium problems ⋮ The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming ⋮ Extragradient methods for nonsmooth equilibrium problems in Banach spaces ⋮ Unified nonlinear Lagrangian approach to duality and optimal paths ⋮ Distributed convergence to Nash equilibria in two-network zero-sum games ⋮ A modified descent method for co-coercive variational inequalities ⋮ Korpelevich's method for variational inequality problems in Banach spaces ⋮ On variable-step relaxed projection algorithm for variational inequalities ⋮ Extragradient Methods for Vector Equilibrium Problems in Banach Spaces ⋮ An extragradient algorithm for monotone variational inequalities ⋮ Interior proximal method for variational inequalities: Case of nonparamonotone operators ⋮ Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings ⋮ An augmented Lagrangian method for a class of Inverse quadratic programming problems ⋮ Iteration-complexity of first-order augmented Lagrangian methods for convex programming ⋮ An extragradient method for vector equilibrium problems on Hadamard manifolds ⋮ Extra-proximal methods for solving two-person nonzero-sum games ⋮ On the resolution of misspecified convex optimization and monotone variational inequality problems ⋮ Splitting-type method for systems of variational inequalities ⋮ On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming ⋮ On general variable-step relaxed projection method for strongly quasivariational inequalities ⋮ Augmented Lagrangian Method for Optimal Control Problems ⋮ Extragradient method with Bregman distances for solving vector quasi-equilibrium problems ⋮ EXTRAGRADIENT METHODS FOR QUASI-EQUILIBRIUM PROBLEMS IN BANACH SPACES

This page was built for publication: