Pages that link to "Item:Q3277806"
From MaRDI portal
The following pages link to The Cutting-Plane Method for Solving Convex Programs (Q3277806):
Displayed 50 items.
- Two-direction subgradient method for non-differentiable optimization problems (Q581239) (← links)
- Cutting sphere algorithm (Q597178) (← links)
- Using central prices in the decomposition of linear programs (Q684317) (← links)
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← 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)
- A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems (Q799488) (← links)
- On the global minimization of concave functions (Q800693) (← links)
- Localization of multi-constrained optima and avoidance of local optima in structural optimization problems (Q801740) (← links)
- Methods for solving multi-extremal problems (global search) (Q811399) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation (Q853887) (← links)
- Robust capacity assignment in telecommunications (Q867429) (← links)
- A matrix generation approach for eigenvalue optimization (Q868452) (← links)
- A bundle modification strategy for convex minimization (Q869143) (← links)
- A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization (Q881511) (← links)
- Benders' decomposition for the constrained \(\ell_ 1\)-problem (Q911464) (← links)
- Multi-level production scheduling for a class of flexible machining and assembly systems (Q918393) (← links)
- On the Behrens-Fisher problem: a globally convergent algorithm and a finite-sample study of the Wald, LR and LM tests (Q955145) (← links)
- A two-stage stochastic programming model for transportation network protection (Q960408) (← links)
- Comparison of a special-purpose algorithm with general-purpose algorithms for solving geometric programming problems (Q1053602) (← links)
- An algorithm for linearly constrained convex nondifferentiable minimization problems (Q1058460) (← links)
- Solving general continuous single facility location problems by cutting planes (Q1086129) (← links)
- The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm (Q1090621) (← links)
- A subgradient selection method for minimizing convex functions subject to linear constraints (Q1092621) (← links)
- A constraint linearization method for nondifferentiable convex minimization (Q1099787) (← links)
- Outer approximation by polyhedral convex sets (Q1101351) (← links)
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488) (← links)
- Partitioning procedures for solving mixed-variables programming problems (Q1131201) (← links)
- A strong duality theorem for the minimum of a family of convex programs (Q1131953) (← links)
- Reverse convex programming (Q1147072) (← 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)
- Un problema di approssimazione connesso con la sintesi di filtri digitali non ricorsivi (Q1150344) (← links)
- Optimal cargo allocation on board a plane: A sequential linear programming approach (Q1152850) (← links)
- Robustness of systems with uncertainties in the input (Q1161712) (← links)
- Investments in stochastic maximum flow networks (Q1176860) (← links)
- A converging algorithm for a linear exchange model (Q1207013) (← links)
- Discrete solutions to engineering design problems (Q1213829) (← links)
- Anregungen aus dem Schnittebenenverfahren für die Lösung des allgemeinen Transportproblems (Q1219826) (← links)
- A comparison of computational strategies for geometric programs (Q1243253) (← links)
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality (Q1257414) (← links)
- Method of centers for minimizing generalized eigenvalues (Q1260783) (← links)
- A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix (Q1260789) (← links)
- Using an interior point method for the master problem in a decomposition approach (Q1278995) (← links)
- Mixed method for solving the general convex programming problem (Q1288666) (← links)
- Warm start of the primal-dual method applied in the cutting-plane scheme (Q1290656) (← links)
- A bundle-Newton method for nonsmooth unconstrained minimization (Q1290669) (← links)
- Stabilized column generation (Q1297485) (← links)
- A note on composite concave quadratic programming (Q1306393) (← links)