A note on exploiting structure when using slack variables
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3833697 (Why is no real title available?)
- scientific article; zbMATH DE number 4070647 (Why is no real title available?)
- scientific article; zbMATH DE number 3725604 (Why is no real title available?)
- scientific article; zbMATH DE number 88933 (Why is no real title available?)
- scientific article; zbMATH DE number 107545 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Inexact Newton Methods
- Large-scale linearly constrained optimization
- Multiplier and gradient methods
- Projected Newton Methods for Optimization Problems with Simple Constraints
Cited in
(4)- A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
- The use of squared slack variables in nonlinear second-order cone programming
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
This page was built for publication: A note on exploiting structure when using slack variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1340068)