Improved constraint consensus methods for seeking feasibility in nonlinear programs
- 16 March 2012
- journal article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 54 (3) , 555-578
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Improving solver success in reaching feasibility for sets of nonlinear constraintsComputers & Operations Research, 2008
- The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear ProgramsINFORMS Journal on Computing, 2004
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problemsParallel Computing, 2001
- Historical Development of the Newton–Raphson MethodSIAM Review, 1995
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problemsLinear Algebra and its Applications, 1989
- Solving systems of nonlinear equations by means of an accelerated successive orthogonal projections methodJournal of Computational and Applied Mathematics, 1986
- Solution of underdetermined nonlinear equations by stationary iteration methodsNumerische Mathematik, 1983
- Cyclic subgradient projectionsMathematical Programming, 1982
- An iterative procedure for the solution of constrained nonlinear equations with application to optimization problemsNumerische Mathematik, 1975
- The method of projections for finding the common point of convex setsUSSR Computational Mathematics and Mathematical Physics, 1967