Results 1  10
of
20
Engineering and economic applications of complementarity problems
 SIAM Review
, 1997
"... Abstract. This paper gives an extensive documentation of applications of finitedimensional nonlinear complementarity problems in engineering and equilibrium modeling. For most applications, we describe the problem briefly, state the defining equations of the model, and give functional expressions f ..."
Abstract

Cited by 132 (24 self)
 Add to MetaCart
Abstract. This paper gives an extensive documentation of applications of finitedimensional nonlinear complementarity problems in engineering and equilibrium modeling. For most applications, we describe the problem briefly, state the defining equations of the model, and give functional expressions for the complementarity formulations. The goal of this documentation is threefold: (i) to summarize the essential applications of the nonlinear complementarity problem known to date, (ii) to provide a basis for the continued research on the nonlinear complementarity problem, and (iii) to supply a broad collection of realistic complementarity problems for use in algorithmic experimentation and other studies.
Algorithms For Complementarity Problems And Generalized Equations
, 1995
"... Recent improvements in the capabilities of complementarity solvers have led to an increased interest in using the complementarity problem framework to address practical problems arising in mathematical programming, economics, engineering, and the sciences. As a result, increasingly more difficult pr ..."
Abstract

Cited by 42 (5 self)
 Add to MetaCart
Recent improvements in the capabilities of complementarity solvers have led to an increased interest in using the complementarity problem framework to address practical problems arising in mathematical programming, economics, engineering, and the sciences. As a result, increasingly more difficult problems are being proposed that exceed the capabilities of even the best algorithms currently available. There is, therefore, an immediate need to improve the capabilities of complementarity solvers. This thesis addresses this need in two significant ways. First, the thesis proposes and develops a proximal perturbation strategy that enhances the robustness of Newtonbased complementarity solvers. This strategy enables algorithms to reliably find solutions even for problems whose natural merit functions have strict local minima that are not solutions. Based upon this strategy, three new algorithms are proposed for solving nonlinear mixed complementarity problems that represent a significant improvement in robustness over previous algorithms. These algorithms have local Qquadratic convergence behavior, yet depend only on a pseudomonotonicity assumption to achieve global convergence from arbitrary starting points. Using the MCPLIB and GAMSLIB test libraries, we perform extensive computational tests that demonstrate the effectiveness of these algorithms on realistic problems. Second, the thesis extends some previously existing algorithms to solve more general problem classes. Specifically, the NE/SQP method of Pang & Gabriel (1993), the semismooth equations approach of De Luca, Facchinei & Kanz...
A Path to the ArrowDebreu Competitive Market Equilibrium
 MATH. PROGRAMMING
, 2004
"... We present polynomialtime interiorpoint algorithms for solving the Fisher and ArrowDebreu competitive market equilibrium problems with linear utilities and n players. Both of them have the arithmetic operation complexity bound of O(n 4 log(1/ɛ)) for computing an ɛequilibrium solution. If the p ..."
Abstract

Cited by 37 (7 self)
 Add to MetaCart
We present polynomialtime interiorpoint algorithms for solving the Fisher and ArrowDebreu competitive market equilibrium problems with linear utilities and n players. Both of them have the arithmetic operation complexity bound of O(n 4 log(1/ɛ)) for computing an ɛequilibrium solution. If the problem data are rational numbers and their bitlength is L, then the bound to generate an exact solution is O(n 4 L) which is in line with the best complexity bound for linear programming of the same dimension and size. This is a significant improvement over the previously best bound O(n 8 log(1/ɛ)) for approximating the two problems using other methods. The key ingredient to derive these results is to show that these problems admit convex optimization formulations, efficient barrier functions and fast rounding techniques. We also present a continuous path leading to the set of the ArrowDebreu equilibrium, similar to the central path developed for linear programming interiorpoint methods. This path is derived from the weighted logarithmic utility and barrier functions and the Brouwer fixedpoint theorem. The defining equations are bilinear and possess some primaldual structure for the application of the Newtonbased pathfollowing method.
On a Homogeneous Algorithm for the Monotone Complementarity Problem
 Mathematical Programming
, 1995
"... We present a generalization of a homogeneous selfdual linear programming (LP) algorithm to solving the monotone complementarity problem (MCP). The algorithm does not need to use any "bigM" parameter or twophase method, and it generates either a solution converging towards feasibility an ..."
Abstract

Cited by 26 (3 self)
 Add to MetaCart
We present a generalization of a homogeneous selfdual linear programming (LP) algorithm to solving the monotone complementarity problem (MCP). The algorithm does not need to use any "bigM" parameter or twophase method, and it generates either a solution converging towards feasibility and complementarity simultaneously or a certificate proving infeasibility. Moreover, if the MCP is polynomially solvable with an interior feasible starting point, then it can be polynomially solved without using or knowing such information at all. To our knowledge, this is the first interiorpoint and infeasiblestarting algorithm for solving the MCP that possesses these desired features. Preliminary computational results are presented. Key words: Monotone complementarity problem, homogeneous and selfdual, infeasiblestarting algorithm. Running head: A homogeneous algorithm for MCP. Department of Management, Odense University, Campusvej 55, DK5230 Odense M, Denmark, email: eda@busieco.ou.dk. y De...
Exchange Market Equilibria with Leontief’s Utility: Freedom of Pricing Leads to Rationality
 Proc. WINE’05
, 2005
"... This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piecewise linear functions, which include linear and Leontief’s utility functions as special cases. We show that the Fisher model again reduces to the weighted analytic cen ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piecewise linear functions, which include linear and Leontief’s utility functions as special cases. We show that the Fisher model again reduces to the weighted analytic center problem, and the same linear programming complexity bound applies to computing its equilibrium. However, the story for the ArrowDebreu model with Leontief’s utility becomes quite different. We show that, for the first time, solving this class of Leontief exchange economies is equivalent to solving a linear complementarity problem whose algorithmic complexity is finite but not polynomially bounded. 1
A Computational Study of the Homogeneous Algorithm for LargeScale Convex Optimization
, 1997
"... Recently the authors have proposed a homogeneous and selfdual algorithm for solving the monotone complementarity problem (MCP) [5]. The algorithm is a single phase interiorpoint type method, nevertheless it yields either an approximate optimal solution or detects a possible infeasibility of th ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
Recently the authors have proposed a homogeneous and selfdual algorithm for solving the monotone complementarity problem (MCP) [5]. The algorithm is a single phase interiorpoint type method, nevertheless it yields either an approximate optimal solution or detects a possible infeasibility of the problem. In this paper we specialize the algorithm to the solution of general smooth convex optimization problems that also possess nonlinear inequality constraints and free variables. We discuss an implementation of the algorithm for largescale sparse convex optimization. Moreover, we present computational results for solving quadratically constrained quadratic programming and geometric programming problems, where some of the problems contain more than 100,000 constraints and variables. The results indicate that the proposed algorithm is also practically efficient. Department of Management, Odense University, Campusvej 55, DK5230 Odense M, Denmark. Email: eda@busieco.ou.dk y ...
Polynomiality of PrimalDual Affine Scaling Algorithms for Nonlinear Complementarity Problems
, 1995
"... This paper provides an analysis of the polynomiality of primaldual interior point algorithms for nonlinear complementarity problems using a wide neighborhood. A condition for the smoothness of the mapping is used, which is related to Zhu's scaled Lipschitz condition, but is also applicable to ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
This paper provides an analysis of the polynomiality of primaldual interior point algorithms for nonlinear complementarity problems using a wide neighborhood. A condition for the smoothness of the mapping is used, which is related to Zhu's scaled Lipschitz condition, but is also applicable to mappings that are not monotone. We show that a family of primaldual affine scaling algorithms generates an approximate solution (given a precision ffl) of the nonlinear complementarity problem in a finite number of iterations whose order is a polynomial of n, ln(1=ffl) and a condition number. If the mapping is linear then the results in this paper coincide with the ones in [13].
Degeneracy in Interior Point Methods for Linear Programming
, 1991
"... ... In this paper, we survey the various theoretical and practical issues related to degeneracy in IPM's for linear programming. We survey results which for the most part already appeared in the literature. Roughly speaking, we shall deal with four topics: the effect of degeneracy on the conver ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
... In this paper, we survey the various theoretical and practical issues related to degeneracy in IPM's for linear programming. We survey results which for the most part already appeared in the literature. Roughly speaking, we shall deal with four topics: the effect of degeneracy on the convergence of IPM's, on the trajectories followed by the algorithms, the effect of degeneracy in numerical performance, and on finding basic solutions.
Centers of Monotone Generalized Complementarity Problems
 Math. Oper. Res
, 1996
"... . Let C be a full dimensional, closed, pointed and convex cone in a finite dimensional real vector space E with an inner product hx; yi of x; y 2 E , and M a maximal monotone subset of E 2 E . This paper studies the existence and continuity of centers of the monotone generalized complementarity prob ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
. Let C be a full dimensional, closed, pointed and convex cone in a finite dimensional real vector space E with an inner product hx; yi of x; y 2 E , and M a maximal monotone subset of E 2 E . This paper studies the existence and continuity of centers of the monotone generalized complementarity problem associated with C and M: Find (x; y) 2 M " (C 2C 3 ) such that hx; yi = 0. Here C 3 = fy 2 E : hx; yi 0 for all x 2 Cg denotes the dual cone of C. The main result of the paper unifies and extends some results established for monotone complementarity problems in Euclidean space and monotone semidefinite linear complementarity problems in symmetric matrices. Key words Central Trajectory, Path of Centers, Complementarity Problem, Interior Point Algorithm, Linear Program Research Report B303 on Mathematical and Computing Sciences, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology. 1 Introduction. The central trajectory or the path of centers is known ...
Monotone Semidefinite Complementarity Problems
, 1996
"... . In this paper, we study some basic properties of the monotone semidefinite nonlinear complementarity problem (SDCP). We show that the trajectory continuously accumulates into the solution set of the SDCP passing through the set of the infeasible but positive definite matrices under certain conditi ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
. In this paper, we study some basic properties of the monotone semidefinite nonlinear complementarity problem (SDCP). We show that the trajectory continuously accumulates into the solution set of the SDCP passing through the set of the infeasible but positive definite matrices under certain conditions. Especially, for the monotone semidefinite linear complementarity problem, the trajectory converges to an analytic center of the solution set, provided that there exists a strictly complementary solution. Finally, we propose the globally convergent infeasibleinteriorpoint algorithm for the SDCP. Key words Monotone Semidefinite Complementarity Problem, Trajectory, Interior Point Algorithm Research Report B312 on Mathematical and Computing Sciences, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology. 1 Introduction. Let M(n) and S(n) denote the class of n2n real matrices and the class of n2n symmetric real matrices, respectively. Assume that A; B 2 M(n)....