The following pages link to Mathematical Programming (Q59162):
Displaying 50 items.
- A constructive characterization ofQ o-matrices with nonnegative principal minors (Q3755249) (← links)
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs (Q3757690) (← links)
- Nested decomposition of multistage nonlinear programs with recourse (Q3757692) (← links)
- The method of successive affine reduction for nonlinear minimization (Q3758575) (← links)
- Necessary and sufficient conditions in constrained optimization (Q3759449) (← links)
- Local properties of inexact methods for minimizing nonsmooth composite functions (Q3760305) (← links)
- Long vectors for quasi-Newton updates (Q3760306) (← links)
- An exact penalty function for semi-infinite programming (Q3762085) (← links)
- A two-stage feasible directions algorithm for nonlinear constrained optimization (Q3762086) (← links)
- Local epi-continuity and local optimization (Q3762093) (← links)
- Robustness and nondegenerateness for linear complementarity problems (Q3762095) (← links)
- A variant of Karmarkar's linear programming algorithm for problems in standard form (Q3767120) (← links)
- Counting almost minimum cutsets with reliability applications (Q3768663) (← links)
- A generalization of Polyak's convergence result for subgradient optimization (Q3768688) (← links)
- An exact penalty function method with global convergence properties for nonlinear programming problems (Q3768690) (← links)
- Trajectory nets connecting all critical points of a smooth function (Q3768692) (← links)
- On the global convergence of path-following methods to determine all solutions to a system of nonlinear equations (Q3769864) (← links)
- Roof duality for polynomial 0–1 optimization (Q3770279) (← links)
- Two algorithms for weighted matroid intersection (Q3770280) (← links)
- A piecewise linear upper bound on the network recourse function (Q3770284) (← links)
- Dual gauge programs, with applications to quadratic programming and the minimum-norm problem (Q3770288) (← links)
- On the complexity of the exchange algorithm for minimax optimization problems (Q3770292) (← links)
- Convex quadratic programming with one constraint and bounded variables (Q3771973) (← links)
- Total dual integrality implies local strong unimodularity (Q3771976) (← links)
- Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds (Q3771993) (← links)
- Greedy algorithm and symmetric matroids (Q3772000) (← links)
- A variable rate refining triangulation (Q3773705) (← links)
- Projected gradient methods for linearly constrained problems (Q3773706) (← links)
- Stochastic global optimization methods part I: Clustering methods (Q3773708) (← links)
- Stochastic global optimization methods part II: Multi level methods (Q3773709) (← links)
- A variable-metric variant of the Karmarkar algorithm for linear programming (Q3775323) (← links)
- Sequential stopping rules for the multistart algorithm in global optimisation (Q3775340) (← links)
- An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex (Q3777792) (← links)
- Dual row modules and polyhedra of blocking group problems (Q3777799) (← links)
- Relaxation methods for problems with strictly convex separable costs and linear constraints (Q3777809) (← links)
- Directional derivatives for the value-function in semi-infinite programming (Q3777822) (← links)
- A dual approach for the continuous collapsing knapsack problem (Q3778543) (← links)
- Some NP-complete problems in quadratic and nonlinear programming (Q3778558) (← links)
- LP extreme points and cuts for the fixed-charge network design problem (Q3778564) (← links)
- Revised dantzig-wolfe decomposition for staircase-structured linear programs (Q3779999) (← links)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds (Q3780005) (← links)
- The (2 n+1−2)-ray algorithm: A new simplicial algorithm to compute economic equilibria (Q3780017) (← links)
- Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming (Q3780756) (← links)
- Bifurcation problems in nonlinear parametric programming (Q3780772) (← links)
- Second order necessary and sufficient conditions for convex composite NDO (Q3782317) (← links)
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges (Q3783052) (← links)
- An active set method for solving linearly constrained nonsmooth optimization problems (Q3783077) (← links)
- A finite characterization ofK-matrices in dimensions less than four (Q3783093) (← links)
- A projected newton method forl p norm location problems (Q3783810) (← links)
- Transportation problems which can be solved by the use of hirsch-paths for the dual problems (Q3783840) (← links)
