A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
From MaRDI portal
Publication:3934159
DOI10.1007/BFb0120949zbMath0477.90069OpenAlexW189195062MaRDI QIDQ3934159
Michael A. Saunders, Bruce A. Murtagh
Publication date: 1982
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0120949
computational resultsimplementationsparse Jacobian matrixlarge-scale nonlinear programsprojected Lagrangian type algorithmsmooth continuously differentiable objective and constraint functionssparse linearly constrained subproblems
Related Items
Designing a superstructure for parametric search for optimal search spaces in non‐trivial optimization problems, A nonhierarchical brand switching model for inferring market structure, Subgradient optimization applied to a discrete nonlinear problem in engineering design, Development and computational tests of an undecoupled optimum short-term hydro-thermal scheduling code using network flows, Using the KKT matrix in an augmented Lagrangian SQP method for sparse constrained optimization, A sparse sequential quadratic programming algorithm, An infeasible nonmonotone SSLE algorithm for nonlinear programming, Nonuniqueness of solutions in applied general equilibrium models with scale economies and imperfect competition, Solving Multiscale Linear Programs Using the Simplex Method in Quadruple Precision, Primal-dual row-action method for convex programming, SLP-IOR: An interactive model management system for stochastic linear programs, Interactions between nonlinear programming and modeling systems, Shape-preserving dynamic programming, Recent developments in constrained optimization, An interior point method for nonlinear programming with infeasibility detection capabilities, A presentation of GAMS for DEA, Linearly constrained optimization, Dynamic programming with shape-preserving rational spline Hermite interpolation, CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems, A hybrid differential dynamic programming algorithm for constrained optimal control problems. I: Theory, On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers, A primal-dual augmented Lagrangian, A nonlinear optimization package for long-term hydrothermal coordination., An augmented Lagrangian filter method, An analytical model for reverse automotive production planning and pricing, The continuous modular design problem with linear separable side constraints, A cost minimization heuristic for the pooling problem, George B. Dantzig and systems optimization, The Sequential Quadratic Programming Method, Newton-type methods: a broader view, Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization, Unnamed Item, QPLIB: a library of quadratic programming instances, A nonlinear optimization methodology for VLSI fixed-outline floorplanning, A Schur method for the square root of a matrix, Procedures for optimization problems with a mixture of bounds and general linear constraints, Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it, Modifications to the subroutine OPALQP for dealing with large problems, A feasible directions method for computing Bayes E-optimal block designs, Analysis and implementation of a dual algorithm for constrained optimization
