Pages that link to "Item:Q3277806"
From MaRDI portal
The following pages link to The Cutting-Plane Method for Solving Convex Programs (Q3277806):
Displaying 50 items.
- BoxStep methods for crew pairing problems (Q833409) (← 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)
- \(\mathrm{M}^4\mathrm{L}\): maximum margin multi-instance multi-cluster learning for scene modeling (Q888567) (← links)
- A partially inexact bundle method for convex semi-infinite minmax problems (Q907208) (← 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)
- New filled functions for nonsmooth global optimization (Q965609) (← links)
- Solving a large scale semi-definite logit model (Q970129) (← links)
- Bounded lower subdifferentiability optimization techniques: applications (Q975769) (← links)
- Robust network design in telecommunications under polytope demand uncertainty (Q976502) (← links)
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976) (← links)
- A geometric characterization of ``optimality-equivalent'' relaxations (Q1016070) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems (Q1016355) (← links)
- On the choice of explicit stabilizing terms in column generation (Q1025985) (← links)
- The radar method: An effective line search for piecewise linear concave functions (Q1026577) (← links)
- A cutting plane algorithm for MV portfolio selection model (Q1036539) (← links)
- An approach to find redundant objective function(s) and redundant constraint(s) in multi-objective nonlinear stochastic fractional programming problems (Q1037660) (← links)
- Supply chain design under uncertainty using sample average approximation and dual decomposition (Q1042158) (← links)
- A linear programming-based optimization algorithm for solving nonlinear programming problems (Q1044083) (← 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)
