A variant of the Topkis-Veinott method for solving inequality constrained optimization problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5811159
- A variant of SQP method for inequality constrained optimization and its global convergence
- scientific article; zbMATH DE number 1437399
- A feasible SQP descent method for inequality constrained optimization problems and its convergence
- A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization
Cited in
(9)- A variant of SQP method for inequality constrained optimization and its global convergence
- On differentiability properties of player convex generalized Nash equilibrium problems
- An efficient sequential quadratic programming algorithm for nonlinear programming
- Bi-level programming approach to optimal strategy for vendor-managed inventory problems under random demand
- Optimal pricing and ordering in global supply chain management with constraints under random demand
- Partially smoothing and gradient-based algorithm for optimizing the VMI system with competitive retailers under random demands
- A validation and verification tool for global optimization solvers
- Elastoplastic analysis of structures under uncertainty: model and solution methods1
- The Method of Pairwise Variations with Tolerances for Linearly Constrained Optimization Problems
This page was built for publication: A variant of the Topkis-Veinott method for solving inequality constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1568186)