Cutting-Plane Methods without Nested Constraint Sets
From MaRDI portal
Cited in
(24)- The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
- Outer approximation by polyhedral convex sets
- A cutting-plane algorithm with linear and geometric rates of convergence
- Investments in stochastic maximum flow networks
- Rates of convergence for a method of centers algorithm
- Infinitely constrained optimization problems
- Minimization methods with constraints
- Some outer approximation methods for semi-infinite optimization problems
- Methods of embedding-cutting off in problems of mathematical programming
- A two-stage cutting-plane method for conditional minimizing function
- Cutting plane algorithms and state space constrained linear optimal control problems
- On cutoff optimization methods in infinite-dimensional spaces and applications
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- A cutting-plane method for quadratic semi infinite programming problems
- Una clase de problemas de decision bajo incertidumbre parcial
- Problemas de decision en incertidumbre parcial bajo hipotesis de monotonias
- On an outer approximation concept in global optimization
- Convergence of a truncation method with deletion at each step
- A central cutting plane algorithm for the convex programming problem
- Convergence bounds for nonlinear programming algorithms
- Computational aspects of cutting-plane algorithms for geometric programming problems
- Applications of a general convergence theory for outer approximation algorithms
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- Lower subdifferentiable functions and their minimization by cutting planes
This page was built for publication: Cutting-Plane Methods without Nested Constraint Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5605015)
