The following pages link to (Q5588268):
Displaying 50 items.
- The principle and models of dynamic programming (Q1320413) (← links)
- Conditions for the uniqueness of the optimal solution in linear semi- infinite programming (Q1321145) (← links)
- On the classical logarithmic barrier function method for a class of smooth convex programming problems (Q1321158) (← links)
- Deriving an unconstrained convex program for linear programming (Q1321279) (← links)
- Characterizations of strict local minima and necessary conditions for weak sharp minima (Q1321486) (← links)
- Nonlinear complementarity as unconstrained and constrained minimization (Q1321650) (← links)
- Global convergence and rate of convergence of a method of centers (Q1328432) (← links)
- Derivation of duality in mathematical programming and optimization theory (Q1328649) (← links)
- Rank-one techniques in log-barrier function methods for linear programming (Q1333365) (← links)
- Global convergence in infeasible-interior-point algorithms (Q1334952) (← links)
- Extensions of the potential reduction algorithm for linear programming (Q1336068) (← links)
- Integral global optimization method for solution of nonlinear complementarity problems (Q1337131) (← links)
- Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204) (← links)
- Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming (Q1338138) (← links)
- Limiting behavior of weighted central paths in linear programming (Q1338144) (← links)
- Interactive decision making: Equivalence of modified formulations (Q1339226) (← links)
- Some properties of the Hessian of the logarithmic barrier function (Q1341572) (← links)
- Subgradient methods for two-stage lexicographic optimization with an infinite number of constraints (Q1343001) (← links)
- Convergence to a second-order point of a trust-region algorithm with a nonmonotonic penalty parameter for constrained optimization (Q1359463) (← links)
- How to deal with the unbounded in optimization: Theory and algorithms (Q1365044) (← links)
- Interior-point methods: An old and new approach to nonlinear programming (Q1365059) (← links)
- Modified primal path-following scheme for the monotone variational inequality problem (Q1372549) (← links)
- Inverse barriers and CES-functions in linear programming (Q1374380) (← links)
- Discontinuous piecewise linear optimization (Q1380942) (← links)
- Modifications of the Wolfe line search rules to satisfy second-order optimality conditions in unconstrained optimization (Q1384067) (← links)
- Automatic decrease of the penalty parameter in exact penalty function methods (Q1388859) (← links)
- A smooth penalty function algorithm for network-structured problems (Q1388940) (← links)
- An application of mathematical programming to sample allocation (Q1390969) (← links)
- A global convergence theory for an active-trust-region algorithm for solving the general nonlinear programing problem. (Q1398662) (← links)
- A practical optimality condition without constraint qualifications for nonlinear programming (Q1407238) (← links)
- Constrained inverse formulations in random material design. (Q1420912) (← links)
- The barrier attribute of filled functions. (Q1426176) (← links)
- Single-period Markowitz portfolio selection, performance gauging, and duality: a variation on the Luenberger shortage function (Q1431697) (← links)
- Galton, Edgeworth, Frisch, and prospects for quantile regression in econometrics (Q1574221) (← links)
- Minimal representation of convex regions defined by analytic functions (Q1577971) (← links)
- Symbiosis between linear algebra and optimization (Q1591197) (← links)
- Interior-point methods (Q1593831) (← links)
- The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators. With comments by Ronald A. Thisted and M. R. Osborne and a rejoinder by the authors (Q1596137) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- Bundle trust-region algorithm for bilinear bilevel programming (Q1608138) (← links)
- Two numerical methods for optimizing matrix stability (Q1611899) (← links)
- An approximate strong KKT condition for multiobjective optimization (Q1617113) (← links)
- A penalty method with trust-region mechanism for nonlinear bilevel optimization problem (Q1636776) (← links)
- Parallel cyclic reduction strategies for linear systems that arise in dynamic optimization problems (Q1639709) (← links)
- A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms (Q1639726) (← links)
- Apart sets and functions: an application to the stability of penalized optimization problems (Q1639958) (← links)
- Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems (Q1673895) (← links)
- Guided dive for the spatial branch-and-bound (Q1675571) (← links)
- On a two-phase approximate greatest descent method for nonlinear optimization with equality constraints (Q1713237) (← links)
- Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization (Q1730794) (← links)
