Pages that link to "Item:Q5525794"
From MaRDI portal
The following pages link to The Supporting Hyperplane Method for Unimodal Programming (Q5525794):
Displaying 50 items.
- Level bundle methods for constrained convex optimization with various oracles (Q404512) (← links)
- Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment (Q486936) (← links)
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs (Q711696) (← links)
- On the convergence of a class of outer approximation algorithms for convex programs (Q789154) (← links)
- Lower subdifferentiable functions and their minimization by cutting planes (Q795741) (← links)
- On the global minimization of concave functions (Q800693) (← links)
- Stochastic programming in water management: A case study and a comparison of solution techniques (Q803039) (← links)
- Reformulating the disjunctive cut generating linear program (Q827289) (← links)
- A discussion of probability functions and constraints from a variational perspective (Q829489) (← links)
- Solving a large scale semi-definite logit model (Q970129) (← links)
- Global optimization on convex sets (Q1089268) (← links)
- The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm (Q1090621) (← links)
- Outer approximation by polyhedral convex sets (Q1101351) (← links)
- A cutting-plane algorithm with linear and geometric rates of convergence (Q1147491) (← links)
- A maximization method for a class of quasiconcave programs (Q1148799) (← links)
- Robustness of systems with uncertainties in the input (Q1161712) (← links)
- Minimization methods with constraints (Q1234628) (← links)
- An iterative procedure for collapse analysis of reinforced concrete plates (Q1249066) (← links)
- Some outer approximation methods for semi-infinite optimization problems (Q1343650) (← links)
- D.C. representability of closed sets in reflexive Banach spaces and applications to optimization problems (Q1359460) (← links)
- On solving generalized convex MINLP problems using supporting hyperplane techniques (Q1668811) (← links)
- Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems (Q1679493) (← links)
- Deletion-by-infeasibility rule for DC-constrained global optimization (Q1893323) (← links)
- Canonical DC programming problem: Outer approximation methods revisited (Q1919172) (← links)
- Methods of embedding-cutting off in problems of mathematical programming (Q1959250) (← links)
- A two-stage cutting-plane method for conditional minimizing function (Q2091512) (← links)
- A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
- An overview of MINLP algorithms and their implementation in Muriqui optimizer (Q2178345) (← links)
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm (Q2200088) (← links)
- Joint chance constrained programming for hydro reservoir management (Q2357212) (← links)
- Approximating data in \({\mathbb R}^{n}\) by a quadratic underestimator with specified Hessian minimum and maximum eigenvalues (Q2433931) (← links)
- A constraint generation algorithm for large scale linear programs using multiple-points separation (Q2492707) (← links)
- On cutoff optimization methods in infinite-dimensional spaces and applications (Q2556038) (← links)
- Solving variational inequalities defined on a domain with infinitely many linear constraints (Q2642631) (← links)
- On the approximation of unbounded convex sets by polyhedra (Q2671446) (← links)
- Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints (Q2692792) (← links)
- Convexity and optimization with copulæ structured probabilistic constraints (Q2817219) (← links)
- On an outer approximation concept in global optimization (Q3830824) (← links)
- ALGORITHMS FOR OPTIMIZATION OF POWER SYSTEMS SCHEDULES BASED ON THE SIMPLEX METHOD (Q4045867) (← links)
- A central cutting plane algorithm for the convex programming problem (Q4081013) (← links)
- Computational aspects of cutting-plane algorithms for geometric programming problems (Q4149242) (← links)
- Algorithms for non-convexS n -games (Q4152068) (← links)
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection (Q5043850) (← links)
- Using projected cutting planes in the extended cutting plane method (Q5057972) (← links)
- Ein heuristisches Verfahren zur globalen Optimierung (Q5623521) (← links)
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming (Q5964241) (← links)
- Polyhedral approximation of spectrahedral shadows via homogenization (Q6150652) (← links)
- A polyhedral approximation algorithm for recession cones of spectrahedral shadows (Q6561494) (← links)
- The geometry of monotone operator splitting methods (Q6598417) (← links)
