Applications of a general convergence theory for outer approximation algorithms
From MaRDI portal
Cites work
- Convergence Conditions for Nonlinear Programming Algorithms
- Convex Analysis
- Cutting-Plane Methods without Nested Constraint Sets
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- scientific article; zbMATH DE number 3186512 (Why is no real title available?)
- Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- Point-to-Set Maps in Mathematical Programming
- Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems
- The Validity of a Family of Optimization Methods
Cited in
(7)- Outer approximation by polyhedral convex sets
- A cutting-plane algorithm with linear and geometric rates of convergence
- On the monotone convergence of algorithmic models
- Infinitely constrained optimization problems
- Some outer approximation methods for semi-infinite optimization problems
- An outer-approximation guided optimization approach for constrained neural network inverse problems
- On an outer approximation concept in global optimization
This page was built for publication: Applications of a general convergence theory for outer approximation algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4770226)
