The following pages link to Mathematical Programming (Q59162):
Displaying 50 items.
- A numerically stable dual method for solving strictly convex quadratic programs (Q59165) (← links)
- A Stochastic Successive Minimization Method for Nonsmooth Nonconvex Optimization with Applications to Transceiver Design in Wireless Communication Networks (Q74057) (← links)
- Benchmarking optimization software with performance profiles (Q83275) (← links)
- A feasible method for optimization with orthogonality constraints (Q101635) (← links)
- Primal-dual subgradient methods for convex problems (Q116219) (← links)
- Smooth minimization of non-smooth functions (Q128676) (← links)
- The Fermat—Weber location problem revisited (Q134352) (← links)
- Solving semidefinite-quadratic-linear programs using SDPT3 (Q146795) (← links)
- Hit-and-run algorithms for the identification of nonredundant linear inequalities (Q3026740) (← links)
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method (Q3026741) (← links)
- Continuous maximin knapsack problems with GLB constraints (Q3028718) (← links)
- Multilevel least-change Newton-like methods for equality constrained optimization problems (Q3028736) (← links)
- A stability concept for matrix game optimal strategies and its application to linear programming sensitivity analysis (Q3028753) (← links)
- A variation on Karmarkar’s algorithm for solving linear programming problems (Q3030578) (← links)
- Global convergence of the partitioned BFGS algorithm for convex partially separable optimization (Q3030592) (← links)
- A convergence theorem of Rosen’s gradient projection method (Q3030593) (← links)
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization (Q3030594) (← links)
- Bayesian stopping rules for multistart global optimization methods (Q3030595) (← links)
- Finding thet-join structure of graphs (Q3030603) (← links)
- Truncated-Newton algorithms for large-scale unconstrained optimization (Q3037163) (← links)
- The sphere method and the robustness of the ellipsoid algorithm (Q3039036) (← links)
- An aggregate subgradient method for nonsmooth convex minimization (Q3039046) (← links)
- A stochastic method for global optimization (Q3039049) (← links)
- On the average number of steps of the simplex method of linear programming (Q3040925) (← links)
- An application of homotopy to solving linear programs (Q3040926) (← links)
- Stability in stochastic programming with recourse-estimated parameters (Q3040930) (← links)
- On characterizingL 1-supports, natural and Chebyshev approximates (Q3040933) (← links)
- An ellipsoid algorithm for nonlinear programming (Q3040934) (← links)
- A note on bicriterion programming (Q3040940) (← links)
- The range of the efficient frontier in multiple objective linear programming (Q3040942) (← links)
- Duality in generalized linear fractional programming (Q3040945) (← links)
- An extension of Tarski's fixed point theorem and its application to isotone complementarity problems (Q3040946) (← links)
- An economic model of short-rotation forestry (Q3042805) (← links)
- Worst-case analysis of greedy algorithms for the subset-sum problem (Q3042877) (← links)
- On the symmetric travelling salesman problem I: Inequalities (Q3048580) (← links)
- On the symmetric travelling salesman problem II: Lifting theorems and facets (Q3048581) (← links)
- On the number of solutions to a class of linear complementarity problems (Q3048608) (← links)
- On the connectedness of the set of almost complementary paths of a linear complementarity problem (Q3048610) (← links)
- Minimum node covers and 2-bicritical graphs (Q3050138) (← links)
- A multiplier method with automatic limitation of penalty growth (Q3050151) (← links)
- Efficient group cuts for integer programs (Q3205025) (← links)
- Second order algorithms for the posynomial geometric programming dual, part I: Analysis (Q3205030) (← links)
- A direct dual method for the mixed plant location problem with some side constraints (Q3206665) (← links)
- OnQ-matrices (Q3206681) (← links)
- A note onQ-matrices (Q3206682) (← links)
- On perfect graphs and polyhedra with (0, 1)-valued extreme points (Q3208440) (← links)
- Stability of the solution of definite quadratic programs (Q3212923) (← links)
- On L1 and Chebyshev estimation (Q3215733) (← links)
- The graph of an abstract polytope (Q3215919) (← links)
- Nonlinear 0–1 programming: I. Linearization techniques (Q3216430) (← links)
