A constrained optimization approach to solving certain systems of convex equations
type: Item
instance of: scholarly article
title: A constrained optimization approach to solving certain systems of convex equations
zbMATH Open document ID: 1102.90042
author: Daniel Solow
author: Hantao Li
published in: European Journal of Operational Research
publication date: 2006-11-15T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 5073122
zbMATH Keywords: nonlinear programming
zbMATH Keywords: convex programming
zbMATH Keywords: nonlinear equations
zbMATH Keywords: convex equations
MaRDI profile type: Publication
full work available at URL: j.ejor.2005.10.041
OpenAlex ID: W1999694142
cites work: Newton's method for linear complementarity problems
cites work: Q3996304
cites work: A globally convergent Newton-GMRES subspace method for systems of nonlinear equations
cites work: Q4003375
cites work: Q3702408
cites work: Q4128913
cites work: Solving Nonlinear Equations with Newton's Method
cites work: EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
cites work: Q3813205
cites work: Equivalence of the Complementarity Problem to a System of Nonlinear Equations
cites work: Global Convergence of Newton–Gauss–Seidel Methods
cites work: Q5652137
cites work: Newton's Method for B-Differentiable Equations
cites work: A finite improvement algorithm for the linear complementarity problem
cites work: Q4386703
cites work: Integrals which are convex functionals
cites work: A finite descent theory for linear programming, piecewise linear convex minimization, and the linear complementarity problem
cites work: Convergence Conditions for Ascent Methods
cites work: Convergence Conditions for Ascent Methods. II: Some Corrections
cites work: Convergence Conditions for Nonlinear Programming Algorithms
DOI: 10.1016/J.EJOR.2005.10.041
description: scientific article; zbMATH DE number 5073122