The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs
Author:
- 1 August 2004
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 16 (3) , 255-265
Abstract
This paper develops a method for moving quickly and cheaply from an arbitrary initial point at an extreme distance from the feasible region to a point that is relatively near the feasible region of a nonlinearly constrained model. The method is a variant of a projection algorithm that is shown to be robust, even in the presence of nonconvex constraints and infeasibility. Empirical results are presented.Keywords
This publication has 9 references indexed in Scilit:
- The Least-Intensity Feasible Solution for Aperture-Based Inverse Planning in Radiation TherapyAnnals of Operations Research, 2003
- Discovering the Characteristics of Mathematical Programs via SamplingOptimization Methods and Software, 2002
- Handbook of Global Optimization2002
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problemsParallel Computing, 2001
- Analyzing Mathematical Programs Using MProbeAnnals of Operations Research, 2001
- Averaging Strings of Sequential Iterations for Convex Feasibility Problems2001
- Handbook of Test Problems in Local and Global Optimization1999
- Optimization1997
- A Collection of Test Problems for Constrained Global Optimization Algorithms1990