Algorithm 1035: a gradient-based implementation of the polyhedral active set algorithm
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 107545 (Why is no real title available?)
- scientific article; zbMATH DE number 724210 (Why is no real title available?)
- scientific article; zbMATH DE number 1424215 (Why is no real title available?)
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- A New Active Set Algorithm for Box Constrained Optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Nonmonotone Line Search Technique for Newton’s Method
- A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
- A quadratically-convergent algorithm for general nonlinear programming problems
- A sparse proximal implementation of the LP dual active set algorithm
- A survey of nonlinear conjugate gradient methods
- Algorithm 813
- Algorithm 851
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- An active set algorithm for nonlinear optimization with polyhedral constraints
- An efficient hybrid algorithm for the separable convex quadratic knapsack problem
- An interior-point algorithm for nonconvex nonlinear programming
- Analysis and implementation of a dual algorithm for constrained optimization
- Application of the dual active set algorithm to quadratic network optimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Complexity and performance of an augmented Lagrangian algorithm
- Continuous nonlinear optimization for engineering applications in GAMS technology
- Convergence properties of trust region methods for linear and convex constraints
- Dual multilevel optimization
- Dual techniques for constrained optimization
- Exposing Constraints
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Large-scale linearly constrained optimization
- Minimization of functions having Lipschitz continuous first partial derivatives
- Modifying a Sparse Cholesky Factorization
- Multiple-rank modifications of a sparse Cholesky factorization
- Nonlinear programming without a penalty function.
- Novel approaches to hard discrete optimization
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On the Global Convergence of a Filter--SQP Algorithm
- On the Identification of Active Constraints
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Practical augmented Lagrangian methods for constrained optimization
- Projection onto a polyhedron that exploits sparsity
- Recent advances in bound constrained optimization
- Row Modifications of a Sparse Cholesky Factorization
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Structured regularization for barrier NLP solvers
- The Limited Memory Conjugate Gradient Method
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- The dual active set algorithm and its application to linear programming
- Two-Point Step Size Gradient Methods
- Updating the Inverse of a Matrix
This page was built for publication: Algorithm 1035: a gradient-based implementation of the polyhedral active set algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601376)
