The following pages link to Mathematical Programming (Q59162):
Displaying 50 items.
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games (Q3688122) (← links)
- A decomposition algorithm for linear relaxation of the weightedr-covering problem (Q3688125) (← links)
- Computing nonlinear network equilibria (Q3688126) (← links)
- Triangulations (tilings) and certain block triangular matrices (Q3688133) (← links)
- Estimation of sparse hessian matrices and graph coloring problems (Q3690096) (← links)
- A projected lagrangian algorithm for semi-infinite programming (Q3690591) (← links)
- Dealing with degeneracy in reduced gradient algorithms (Q3691433) (← links)
- Computing optimal scalings by parametric network algorithms (Q3691441) (← links)
- Stable modification of explicitLU factors for simplex updates (Q3692731) (← links)
- Extracting embedded generalized networks from linear programming problems (Q3693261) (← links)
- Roof duality, complementation and persistency in quadratic 0–1 optimization (Q3693267) (← links)
- A fast and robust unconstrained optimization method requiring minimum storage (Q3693274) (← links)
- A variable dimension fixed point algorithm and the orientation of simplices (Q3694554) (← links)
- Permutation congruent transformations of the freudenthal triangulation with minimum surface density (Q3694571) (← links)
- An example of irregular convergence in some constrained optimization methods that use the projected hessian (Q3696876) (← links)
- Conditions for convergence of trust region algorithms for nonsmooth optimization (Q3696877) (← links)
- Stopping criteria for linesearch methods without derivatives (Q3696884) (← links)
- On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials (Q3698168) (← links)
- On the cost of approximating all roots of a complex polynomial (Q3698169) (← links)
- On the length of simplex paths: The assignment case (Q3698637) (← links)
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization (Q3698656) (← links)
- On the acyclic subgraph polytope (Q3698818) (← links)
- Facets of the linear ordering polytope (Q3698819) (← links)
- Asymmetric variational inequality problems over product sets: Applications and iterative methods (Q3700355) (← links)
- Efficient dual simplex algorithms for the assignment problem (Q3701192) (← links)
- Simplex pivots on the set packing polytope (Q3701197) (← links)
- Properties of a representation of a basis for the null space (Q3702391) (← links)
- On the complexity of four polyhedral set containment problems (Q3703587) (← links)
- Convergence of an annealing algorithm (Q3703588) (← links)
- Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems (Q3703589) (← links)
- How bad are the BFGS and DFP methods when the objective function is quadratic? (Q3703596) (← links)
- A decomposition property of polyhedra (Q3703640) (← links)
- Solving matching problems with linear programming (Q3703653) (← links)
- A unified approach to one-parametric general quadratic programming (Q3703660) (← links)
- Globally convergent conjugate gradient algorithms (Q3703663) (← links)
- Inclusion functions and global optimization (Q3703666) (← links)
- Vector maximisation and lagrange multipliers (Q3703667) (← links)
- A simplex algorithm for piecewise-linear programming I: Derivation and proof (Q3703668) (← links)
- Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs (Q3703671) (← links)
- Differentiability with respect to parameters of solutions to convex programming problems (Q3704503) (← links)
- Descent methods for composite nondifferentiable optimization problems (Q3705231) (← links)
- Facet inequalities from simple disjunctions in cutting plane theory (Q3707764) (← links)
- Structure of the first-order solution set for a class of nonlinear programs with parameters (Q3707781) (← links)
- Random linear programs with many variables and few constraints (Q3710288) (← links)
- The cutting stock problem and integer rounding (Q3710296) (← links)
- Complexity of some parametric integer and network programming problems (Q3712126) (← links)
- Distribution sensitivity analysis for stochastic programs with complete recourse (Q3713865) (← links)
- Performance evaluation of nonlinear optimization methods via pairwise comparison and fuzzy numbers (Q3713867) (← links)
- A note on strong perfectness of graphs (Q3714102) (← links)
- Exact penalty functions and stability in locally Lipschitz programming (Q3714912) (← links)
