Pages that link to "Item:Q4086973"

The following pages link to A finite algorithm to maximize certain pseudoconcave functions on polytopes (Q4086973):

Displaying 25 items.

• Imperfect conjugate gradient algorithms for extended quadratic functions (Q584912) (← links)
• Method to determine an optimal control in the minimum of resource consumption for the nonlinear stationary systems (Q1040455) (← links)
• Convergence of a subgradient method for computing the bound norm of matrices (Q1057619) (← links)
• Finiteness in restricted simplicial decomposition (Q1069859) (← links)
• A note on a globally convergent Newton method for solving monotone variational inequalities (Q1091770) (← links)
• Least distance methods for the frame of homogeneous equation systems (Q1098570) (← links)
• Minimizing pseudoconvex functions on convex compact sets (Q1120481) (← links)
• A generalized conjugate gradient algorithm for minimization (Q1135089) (← links)
• Epsilon-dominating solutions in mean-variance portfolio analysis (Q1291760) (← links)
• A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods (Q1338143) (← links)
• A multifactor model for international plant location and financing under uncertainty (Q1821012) (← links)
• Maximizing pseudoconvex transportation problem: A special type (Q1891876) (← links)
• A numerical method to minimize resource consumption by linear systems with constant delay (Q2261808) (← links)
• An augmented Lagrangian decomposition method for block diagonal linear programming problems (Q2314414) (← links)
• Equivalence of some quadratic programming algorithms (Q3343781) (← links)
• A partial linearization method for the traffic assignment problem (Q3835623) (← links)
• A decomposition algorithm for quadratic programming (Q3870676) (← links)
• An equivalence between two algorithms for quadratic programming (Q3895232) (← links)
• A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems (Q4000924) (← links)
• Finding the nearest point in A polytope (Q4123085) (← links)
• Simplicial decomposition in nonlinear programming algorithms (Q4136951) (← links)
• Least distance methods for the scheme of polytopes (Q4192906) (← links)
• Simplicial Decomposition for Convex Generalized Networks (Q4712275) (← links)
• Minimization of a convex functional in a linear system of delay differential equations with fixed ends (Q5413113) (← links)
• Variable metric method for unconstrained multiobjective optimization problems (Q6047575) (← links)