Nonlinear Programming 3
Proceedings of the Special Interest Group on Mathematical Programming Symposium Conducted by the Computer Sciences Department at the University of Wisconsin-Madison, July 11-13, 1977
Published on 10. May 2014
486 pages
978-1-4832-6032-7 (ISBN)
Description
Nonlinear Programming 3 covers the proceedings of the Special Interest Group on Mathematical Programming Symposium conducted by the Computer Sciences Department at the University of Wisconsin, Madison, on July 11-13, 1977. This book is composed of 17 chapters. The first eight chapters describe some of the most effective methods available for solving linearly and nonlinearly constrained optimization problems. The subsequent chapter gives algorithms for the solution of nonlinear equations together with computational experience. Other chapters provide some applications of optimization in operations research and a measurement procedure for optimization algorithm efficiency. These topics are followed by discussion of the methods for solving large quadratic programs and algorithms for solving stationary and fixed point problems. The last chapters consider the minimization of certain types of nondifferentiable functions and a type of Newton method. This book will prove useful to mathematicians and computer scientists.
More details
Other editions
Additional editions
Book
09/1978
Academic Press
€71.19
Article exhausted; check different version
Content
ContributorsPrefaceMonotone Operators and Augmented Lagrangian Methods in Nonlinear ProgrammingThe Convergence of Variable Metric Methods for Nonlinearly Constrained Optimization CalculationsA Hybrid Method for Nonlinear ProgrammingTwo-Phase Algorithm for Nonlinear Constraint ProblemsQuasi-Newton Methods for Equality Constrained Optimization: Equivalence of Existing Methods and a New ImplementationAn Idealized Exact Penalty FunctionExact Penalty Algorithms for Nonlinear ProgrammingA Variable Metric Method for Linearly Constrained Minimization ProblemsSolving Systems of Nonlinear Equations by Broyden's Method with Projected UpdatesAt the Interface of Modeling and Algorithms ResearchModeling Combinatorial Mathematical Programming Problems by Netforms: An Illustrative ApplicationOn the Comparative Evaluation of Algorithms for Mathematical Programming ProblemsA Special Class of Large Quadratic ProgramsComputing Stationary Points, AgainA Combinatorial Lemma for Fixed Point AlgorithmsMinimisation de Fonctions Localement Lipschitziennes: Applications a la Programmation Mi-Convexe, Mi-DifferentiableA Modified Newton Algorithm for Functions over Convex SetsSubject Index
