Results 1  10
of
303
Smoothing Of Mixed Complementarity Problems
 IN COMPLEMENTARITY AND VARIATIONAL PROBLEMS: STATE OF THE
, 1995
"... We extend the smoothing approach to the mixed complementarity problem, and study the limiting behavior of a path defined by approximate minimizers of a nonlinear least squares problem. Our main result guarantees that, under a mild regularity condition, limit points of the iterates are solutions to t ..."
Abstract

Cited by 30 (0 self)
 Add to MetaCart
We extend the smoothing approach to the mixed complementarity problem, and study the limiting behavior of a path defined by approximate minimizers of a nonlinear least squares problem. Our main result guarantees that, under a mild regularity condition, limit points of the iterates are solutions
On the Regularization of Mixed Complementarity Problems
, 1999
"... A variational inequality problem (VIP) satisfying a constraint qualification can be reduced to a mixed complementarity problem (MCP). Monotonicity of the VIP implies that the MCP is also monotone. Introducing regularizing perturbations, a sequence of strictly monotone mixed complementarity probl ..."
Abstract
 Add to MetaCart
A variational inequality problem (VIP) satisfying a constraint qualification can be reduced to a mixed complementarity problem (MCP). Monotonicity of the VIP implies that the MCP is also monotone. Introducing regularizing perturbations, a sequence of strictly monotone mixed complementarity
MCPLIB: A Collection of Nonlinear Mixed Complementarity Problems
 Optimization Methods and Software
, 1994
"... The origins and some motivational details of a collection of nonlinear mixed complementarity problems are given. This collection serves two purposes. Firstly, it gives a uniform basis for testing currently available and new algorithms for mixed complementarity problems. Function and Jacobian evaluat ..."
Abstract

Cited by 90 (31 self)
 Add to MetaCart
The origins and some motivational details of a collection of nonlinear mixed complementarity problems are given. This collection serves two purposes. Firstly, it gives a uniform basis for testing currently available and new algorithms for mixed complementarity problems. Function and Jacobian
NOMENCLATURE MCP Mixed Complementarity Problem
"... Abstract. Designing yacht rigs using empirical rules of thumb and large margins of safety can result in rigs that are substantially heavier than they need to be. We describe a suite of mathematical programming models for optimizing the dimensions and minimum scantlings of carbonfibre rigs. By using ..."
Abstract
 Add to MetaCart
. By using mixed complementarity models the finiteelement analysis of the rig is extended to handle tensiononly cable elements in a natural way. This leads to optimization problems that are mathematical programs with equilibrium constraints. We describe models for optimizing pretension in a rig over
Robust Solution Of Mixed Complementarity Problems
, 1994
"... This thesis is concerned with algorithms and software for the solution of the Mixed Complementarity Problem, or MCP. The MCP formulation is useful for expressing systems of nonlinear inequalities and equations; the complementarity allows boundary conditions be to specified in a succinct manner. Prob ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
This thesis is concerned with algorithms and software for the solution of the Mixed Complementarity Problem, or MCP. The MCP formulation is useful for expressing systems of nonlinear inequalities and equations; the complementarity allows boundary conditions be to specified in a succinct manner
The PATH Solver: A NonMonotone Stabilization Scheme for Mixed Complementarity Problems
 OPTIMIZATION METHODS AND SOFTWARE
, 1995
"... The Path solver is an implementation of a stabilized Newton method for the solution of the Mixed Complementarity Problem. The stabilization scheme employs a pathgeneration procedure which is used to construct a piecewiselinear path from the current point to the Newton point; a step length acceptan ..."
Abstract

Cited by 213 (40 self)
 Add to MetaCart
The Path solver is an implementation of a stabilized Newton method for the solution of the Mixed Complementarity Problem. The stabilization scheme employs a pathgeneration procedure which is used to construct a piecewiselinear path from the current point to the Newton point; a step length
A Homotopy Based Algorithm for Mixed Complementarity Problems
, 1998
"... This paper develops an algorithm for solving mixed complementarity problems which is based upon probability one homotopy methods. After the complementarity problem is reformulated as a system of nonsmooth equations, a homotopy method is used to solve a sequence of smooth approximations to this syste ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
This paper develops an algorithm for solving mixed complementarity problems which is based upon probability one homotopy methods. After the complementarity problem is reformulated as a system of nonsmooth equations, a homotopy method is used to solve a sequence of smooth approximations
Formulating and Solving Nonlinear Programs as Mixed Complementarity Problems
 OPTIMIZATION. LECTURE NOTES IN ECONOMICS AND MATHEMATICAL SYSTEMS
, 2000
"... We consider a primaldual approach to solve nonlinear programming problems within the AMPL modeling language, via a mixed complementarity formulation. The modeling language supplies the first order and second order derivative information of the Lagrangian function of the nonlinear problem using auto ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We consider a primaldual approach to solve nonlinear programming problems within the AMPL modeling language, via a mixed complementarity formulation. The modeling language supplies the first order and second order derivative information of the Lagrangian function of the nonlinear problem using
ProbabilityOne Homotopy Maps for Mixed Complementarity Problems
, 2007
"... Probabilityone homotopy algorithms have strong convergence characteristics under mild assumptions. Such algorithms for mixed complementarity problems (MCPs) have potentially wide impact because MCPs are pervasive in science and engineering. A probabilityone homotopy algorithm for MCPs was develope ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Probabilityone homotopy algorithms have strong convergence characteristics under mild assumptions. Such algorithms for mixed complementarity problems (MCPs) have potentially wide impact because MCPs are pervasive in science and engineering. A probabilityone homotopy algorithm for MCPs
Results 1  10
of
303