Solving a class of linear projection equations
From MaRDI portal
Publication:1338824
DOI10.1007/s002110050048zbMath0822.65040OpenAlexW2063471227MaRDI QIDQ1338824
Publication date: 21 November 1994
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002110050048
unconstrained optimizationNewton methodlinear convergenceLevenberg-Marquardt methodill-conditioned problemssteepest descent methodprojection and contraction methodsearch directions
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (38)
Some recent advances in projection-type methods for variational inequalities ⋮ A class of projection and contraction methods for monotone variational inequalities ⋮ Self-adaptive projection method for co-coercive variational inequalities ⋮ A class of iterative methods for solving nonlinear projection equations ⋮ Solving linear variational inequality problems by a self-adaptive projection method ⋮ On the iteration complexity of some projection methods for monotone linear variational inequalities ⋮ A new method for a class of nonlinear variational inequalities with fuzzy mappings ⋮ Solving symmetric monotone linear variational inequalities by some modified Levitin-Polyak projection methods ⋮ Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs ⋮ Some Goldstein's type methods for co-coercive variant variational inequalities ⋮ A new decomposition method for variational inequalities with linear constraints ⋮ Solving a class of matrix minimization problems by linear variational inequality approaches ⋮ New decomposition methods for solving variational inequality problems. ⋮ A proximal decomposition algorithm for variational inequality problems. ⋮ A mixed finite element scheme for optimal control problems with pointwise state constraints ⋮ Solving the matrix nearness problem in the maximum norm by applying a projection and contraction method ⋮ Decomposition method for a class of monotone variational inequality problems ⋮ A modified alternating direction method for convex minimization problems ⋮ A class of projection and contraction methods for asymmetric linear variational inequalities and their relations to Fukushima's descent method ⋮ A new splitting method for monotone inclusions of three operators ⋮ An Alternating Direction Method of Multipliers for Optimal Control Problems Constrained with Elliptic Equations ⋮ A new class of projection and contraction methods for solving variational inequality problems ⋮ Error analysis of variational discretization solving temperature control problems ⋮ A modified descent method for co-coercive variational inequalities ⋮ Solving semidefinite programming problems via alternating direction methods ⋮ A new class of iterative algorithms for approximation-solvability of nonlinear variational inequalities ⋮ Projection methods, algorithms, and a new system of nonlinear variational inequalities ⋮ A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs ⋮ Dynamic design, numerical solution and effective verification of acceleration-level obstacle-avoidance scheme for robot manipulators ⋮ Improvements of some projection methods for monotone nonlinear variational inequalities ⋮ A modified projection algorithm for large strictly-convex quadratic programs ⋮ Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities ⋮ The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense ⋮ Forward–backward-based descent methods for composite variational inequalities ⋮ Projection and contraction method for updating simultaneously mass and stiffness matrices ⋮ An LS-free splitting method for composite mappings ⋮ A self-adaptive projection and contraction method for monotone symmetric linear variational inequalities. ⋮ A new stepsize rule in He and Zhou's alternating direction method
This page was built for publication: Solving a class of linear projection equations
