The following pages link to (Q5652460):
Displayed 50 items.
- A stochastic multidimensional unfolding approach for representing phased decision outcomes (Q676474) (← links)
- Optimal control of a nonlinear mechanical system by instantaneous impulses (Q684627) (← links)
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis (Q790580) (← links)
- The cross-entropy method for continuous multi-extremal optimization (Q861537) (← links)
- On three new approaches to handle constraints within evolution strategies (Q862967) (← links)
- GENFOLD 2: A set of models and algorithms for the GENeral unFOLDing analysis of preference/dominance data (Q1057601) (← links)
- The representation of three-way proximity data by single and multiple tree structure models (Q1059960) (← links)
- Least absolute deviations estimation for the censored regression model (Q1061446) (← links)
- A globally convergent algorithm for nonlinearly constrained optimization problems (Q1071653) (← links)
- Bounded flow round a supercavitating wing of finite span (Q1079052) (← links)
- Three-way metric unfolding via alternating weighted least squares (Q1079311) (← links)
- Experiments with successive quadratic programming algorithms (Q1090233) (← links)
- An adaptive search algorithm for numerical optimization (Q1100854) (← links)
- An analog of the flexible polyhedron method for scheduling problems (Q1102854) (← links)
- Methods of unconditional minimization of functions using a simplex (Q1119477) (← links)
- Iterative linear programming solution of convex programs (Q1120478) (← links)
- Linearly constrained optimization (Q1122324) (← links)
- Multicriteria models for the allocation of design parameter targets (Q1124681) (← links)
- Constrained optimization with normed moving truncations penalty-functions (Q1134630) (← links)
- On design problems of grid shells (Q1137431) (← links)
- A class of generalized variable penalty methods for nonlinear programming (Q1138234) (← links)
- Reversed geometric programming: A branch-and-bound method involving linear subproblems (Q1141082) (← links)
- Globally convergent version of Robinson's algorithm for general nonlinear programming problems without using derivatives (Q1142159) (← links)
- Variable penalty methods for constrained minimization (Q1148104) (← links)
- A variant of the generalized reduced gradient algorithm for non-linear programming and its applications (Q1148804) (← links)
- A globally and quadratically convergent algorithm for general nonlinear programming problems (Q1151728) (← links)
- A penalty treatment of equality constraints in generalized geometric programming (Q1158346) (← links)
- On Penalty methods for interelement constraints (Q1163415) (← links)
- A least-distance programming procedure for minimization problems under linear constraints (Q1170113) (← links)
- A comparative performance evaluation of 27 nonlinear programming codes (Q1171003) (← links)
- Some implementation issues associated with multidimensional interval Newton methods (Q1179538) (← links)
- An analytical approach to global optimization (Q1181733) (← links)
- Calculation of limiting configuration of stagnant zones when viscoplastic oil is displaced by water (Q1183870) (← links)
- Thin weakly curved wings with maximum aerodynamic quality (Q1190918) (← links)
- TSCALE: A new multidimensional scaling procedure based on Tversky's contrast model (Q1205768) (← links)
- A computational study of methods for solving polynomial geometric programs (Q1218172) (← links)
- Decentralized optimization for distributed-lag models of discrete systems (Q1221384) (← links)
- Eine Klasse von Verfahren zur Ermittlung bester nichtlinearer Tschebyscheff-Approximationen (Q1228324) (← links)
- A rank-one algorithm for unconstrained function minimization (Q1228552) (← links)
- Numerische Methoden zur Behandlung einiger Problemklassen der nichtlinearen Tschebyscheff-Approximation mit Nebenbedingungen (Q1230343) (← links)
- Generalized reduced gradient method as an extension of feasible direction methods (Q1230358) (← links)
- On the accelerating property of an algorithm for function minimization without calculating derivatives (Q1234558) (← links)
- Minimization methods with constraints (Q1234628) (← links)
- A gradient projection-multiplier method for nonlinear programming (Q1235642) (← links)
- Current state of the art of algorithms and computer software for geometric programming (Q1243249) (← links)
- Nonoptimal termination properties of quadratic interpolation univariate searches (Q1249520) (← links)
- An algorithm for minimizing a differentiable function subject to box constraints and errors (Q1249930) (← links)
- Efficient estimation of income distribution parameters (Q1250665) (← links)
- Test example for nonlinear programming codes (Q1252157) (← links)
- A quasi-Newton method for minimization under linear constraints without evaluating any derivatives (Q1255302) (← links)