The following pages link to (Q3277015):
Displaying 50 items.
- On the removal of ill conditioning effects in the computation of optimal controls (Q1221928) (← links)
- A systematic approach to the synthesis of algorithms (Q1224412) (← links)
- A convergence theory for a class of anti-jamming strategies (Q1228553) (← links)
- A conjugate direction algorithm without line searches (Q1234560) (← links)
- Approximation methods for the unconstrained optimization (Q1234630) (← links)
- An accelerated conjugate direction method to solve linearly constrained minimization problems (Q1235063) (← links)
- Accelerated conjugate direction methods for unconstrained optimization (Q1236069) (← links)
- Feasible directions in economic policy (Q1240138) (← links)
- An algorithm for minimizing a differentiable function subject to box constraints and errors (Q1249930) (← links)
- Algorithmic equivalence in quadratic programming. I. A least-distance programming problem (Q1250029) (← links)
- A geometric method in nonlinear programming (Q1253613) (← links)
- The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables (Q1259272) (← links)
- Algorithms for a class of computer-aided design problems: A review (Q1260353) (← links)
- Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD (Q1280097) (← links)
- New reflection generator for simulated annealing in mixed-integer/continuous global optimization (Q1291825) (← links)
- A generalization of the norm-relaxed method of feasible directions (Q1294211) (← links)
- The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review (Q1312749) (← links)
- Convergence analysis of norm-relaxed method of feasible directions (Q1359453) (← links)
- Self-tuning norm-relaxed method of feasible directions (Q1367804) (← links)
- Optimal elastic design of trusses by feasible direction methods (Q1393982) (← links)
- Evaluating jointly constrained order quantity complexities for incremental discounts. (Q1399601) (← links)
- A new SQP method of feasible directions for nonlinear programming. (Q1415268) (← links)
- Parameter detection of thin films from their X-ray reflectivity by support vector machines. (Q1427212) (← links)
- Optimization over the efficient set of a parametric multiple objective linear programming problem (Q1577111) (← links)
- A decomposition method for large-scale box constrained optimization (Q1644498) (← links)
- An accurate method for real-time aircraft dynamics simulation based on predictor-corrector scheme (Q1664936) (← links)
- An efficient sequential quadratic programming algorithm for nonlinear programming (Q1765487) (← links)
- A feasible interior-point algorithm for nonconvex nonlinear programming (Q1774879) (← links)
- Computational methods for optimum design of large complex systems (Q1820022) (← links)
- A feasible conjugate direction method to solve linearly constrained minimization problems (Q1843375) (← links)
- First-order strong variation algorithms for optimal control problems with terminal inequality constraints (Q1844439) (← links)
- Probabilistic version of the method of feasible directions. (Q1855739) (← links)
- Shape design sensitivity analysis with respect to the positioning of features in composite structures using the boundary element method (Q1958124) (← links)
- Vertex assigned morphing for parameter free shape optimization of 3-dimensional solid structures (Q1988089) (← links)
- Analysis of equal-share and equalized flow distribution at the peak load in the multiuser network (Q2134301) (← links)
- Finding second-order stationary points in constrained minimization: a feasible direction approach (Q2194125) (← links)
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
- Mathematical model and efficient algorithms for object packing problem (Q2269838) (← links)
- Optimal packings for filled rings of circles. (Q2304216) (← links)
- Necessary and sufficient conditions for emptiness of the cones of generalized support vectors (Q2341097) (← links)
- Nonlinear goal programming theory and practice: A survey (Q2367049) (← links)
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate (Q2370024) (← links)
- Modified combined relaxation method for general monotone equilibrium problems in Hilbert spaces (Q2370069) (← links)
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints (Q2372939) (← links)
- Pivoting in linear complementarity: Two polynomial-time cases (Q2391195) (← links)
- A new method for solving conditioned maxima problems (Q2394210) (← links)
- A sequential quadratically constrained quadratic programming method of feasible directions (Q2480785) (← links)
- A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization (Q2510002) (← links)
- Algorithms for some minimax problems (Q2533707) (← links)
- On variable-metric algorithms (Q2541844) (← links)
