A pathsearch damped Newton method for computing general equilibria
From MaRDI portal
Publication:2365112
DOI10.1007/BF02209613zbMath0868.90012MaRDI QIDQ2365112
Steven P. Dirkse, Michael C. Ferris
Publication date: 4 August 1997
Published in: Annals of Operations Research (Search for Journal in Brave)
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) General equilibrium theory (91B50) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Implementation of a continuation method for normal maps, Master problem approximations in Dantzig-Wolfe decomposition of variational inequality problems with applications to two energy market models, A new method for solving Pareto eigenvalue complementarity problems, Tacit collusion games in pool-based electricity markets under transmission constraints, Improvements of the Newton-Raphson method, A structure-preserving pivotal method for affine variational inequalities, General equilibrium models and homotopy methods, A path to the Arrow-Debreu competitive market equilibrium, Complementarity problems in GAMS and the PATH solver
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- Extension of GAMS for complementarity problems arising in applied economic analysis
- Convergence of stationary sequences for variational inequalities with maximal monotone operators
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- A new continuation method for complementarity problems with uniform P- functions
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Crashing a maximum-weight complementary basis
- An inexact NE/SQP method for solving the nonlinear complementarity problem
- Nonlinear complementarity as unconstrained and constrained minimization
- Nonmonotone stabilization methods for nonlinear equations
- Newton's method for a class of nonsmooth functions
- A nonsmooth Newton method for variational inequalities. I: Theory
- A class of smoothing functions for nonlinear and mixed complementarity problems
- Applied general equilibrium modeling with MPSGE as a GAMS subsystem: An overview of the modeling framework and syntax
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- Minimization of functions having Lipschitz continuous first partial derivatives
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- Homotopy Continuation Methods for Nonlinear Complementarity Problems
- Normal Maps Induced by Linear Transformations
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- Global Convergence of Damped Newton's Method for Nonsmooth Equations via the Path Search
- A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
- Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems
- A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
- An algorithm based on a sequence of linear complementarity problems applied to a walrasian equilibrium model: An example
- A Nonmonotone Line Search Technique for Newton’s Method
- A Positive Algorithm for the Nonlinear Complementarity Problem
- Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach
- Equilibrium Points of Bimatrix Games
- Pivot selection methods of the Devex LP code
