A superlinearly convergent constrained min-max algorithm for rival models of the same system
From MaRDI portal
(Redirected from Publication:1119151)
Recommendations
Cites work
- scientific article; zbMATH DE number 3116768 (Why is no real title available?)
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 3726053 (Why is no real title available?)
- scientific article; zbMATH DE number 3492382 (Why is no real title available?)
- scientific article; zbMATH DE number 3492396 (Why is no real title available?)
- scientific article; zbMATH DE number 3581863 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 3378729 (Why is no real title available?)
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- A general saddle point result for constrained optimization
- An Efficient Method to Solve the Minimax Problem Directly
- An algorithm for convex constrained minimax optimization based on duality
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- Minimax solution of the multiple-target problem
- New algorithms for constrained minimax optimization
- On a class of differential games
- Optimal fixed rules and simple feedback laws in the design of economic policy
- Projection methods in constrained optimisation and applications to optimal policy decisions
Cited in
(4)
This page was built for publication: A superlinearly convergent constrained min-max algorithm for rival models of the same system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1119151)