A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
From MaRDI portal
Cited in
(43)- A smoothed augmented Lagrangian framework for convex optimization with nonsmooth constraints
- The Sequential Quadratic Programming Method
- Interactions between nonlinear programming and modeling systems
- QPLIB: a library of quadratic programming instances
- An augmented Lagrangian filter method
- A sparse sequential quadratic programming algorithm
- Modifications to the subroutine OPALQP for dealing with large problems
- Recent developments in constrained optimization
- A nonlinear optimization package for long-term hydrothermal coordination.
- A hybrid differential dynamic programming algorithm for constrained optimal control problems. I: Theory
- An infeasible nonmonotone SSLE algorithm for nonlinear programming
- An interior point method for nonlinear programming with infeasibility detection capabilities
- A Schur method for the square root of a matrix
- Linearly constrained optimization
- A primal-dual augmented Lagrangian
- 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
- On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers
- Algorithm 1035: a gradient-based implementation of the polyhedral active set algorithm
- Nonuniqueness of solutions in applied general equilibrium models with scale economies and imperfect competition
- The continuous modular design problem with linear separable side constraints
- Nonsmooth exact penalty methods for equality-constrained optimization: complexity and implementation
- Procedures for optimization problems with a mixture of bounds and general linear constraints
- Dynamic programming with shape-preserving rational spline Hermite interpolation
- Shape-preserving dynamic programming
- Solving multiscale linear programs using the simplex method in quadruple precision
- A nonhierarchical brand switching model for inferring market structure
- Analysis and implementation of a dual algorithm for constrained optimization
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- An analytical model for reverse automotive production planning and pricing
- A nonlinear optimization methodology for VLSI fixed-outline floorplanning
- A cost minimization heuristic for the pooling problem
- SLP-IOR: An interactive model management system for stochastic linear programs
- Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it
- Primal-dual row-action method for convex programming
- Subgradient optimization applied to a discrete nonlinear problem in engineering design
- 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
- A feasible directions method for computing Bayes E-optimal block designs
- Designing a superstructure for parametric search for optimal search spaces in non‐trivial optimization problems
- A presentation of GAMS for DEA
- George B. Dantzig and systems optimization
- scientific article; zbMATH DE number 13594 (Why is no real title available?)
This page was built for publication: A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3934159)
