The following pages link to (Q3277015):
Displaying 50 items.
- Optimal quantization of the support of a continuous multivariate distribution based on mutual information (Q269123) (← links)
- Sensitivity analysis of optimum solutions by updating active constraints: application in aircraft structural design (Q381678) (← links)
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052) (← links)
- Enumeration of PLCP-orientations of the 4-cube (Q491752) (← links)
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity (Q556270) (← links)
- The steepest descent gravitational method for linear programming (Q583105) (← links)
- Max-min resource allocation (Q595529) (← links)
- Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions (Q597172) (← links)
- Combinatorial characterizations of \(K\)-matrices (Q609481) (← links)
- A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems (Q632650) (← links)
- A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization (Q646746) (← links)
- Constructive characterization of Lipschitzian \(Q_ 0\)-matrices (Q676035) (← links)
- A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization (Q742307) (← links)
- An exact penalty function algorithm for optimal control problems with control and terminal equality constraints. I (Q755155) (← links)
- An interior feasible direction method with constraint projections for linear programming (Q804468) (← links)
- Solving the minimax open-loop control problem for carrier rocket fuel consumption (Q827910) (← links)
- A discussion of probability functions and constraints from a variational perspective (Q829489) (← links)
- A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity (Q833162) (← links)
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q858741) (← links)
- A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization (Q881511) (← links)
- Finitely convergent \(\varepsilon\)-generalized projection algorithm for nonlinear systems (Q884390) (← links)
- Feasibility preserving constraint-handling strategies for real parameter evolutionary optimization (Q902102) (← links)
- Canonical bases in linear programming (Q908850) (← links)
- An efficient approach to updating simplex multipliers in the simplex algorithm (Q927163) (← links)
- Scope of stationary multi-objective evolutionary optimization: a case study on a hydro-thermal power dispatch problem (Q934802) (← links)
- On the convergence of the Pshenichnyi-Pironneau-Polak minimax algorithm with an active set strategy (Q939106) (← links)
- Maximally stable lobed balloons (Q994641) (← links)
- An approximation-concepts approach to shape optimal design (Q1057119) (← links)
- Enhanced methods for feasible directions for engineering design problems (Q1068727) (← links)
- On the globalization of Wilson-type optimization methods by means of generalized reduced gradient methods (Q1072349) (← links)
- Optimal scheduling of reservoir releases during flood: Deterministic optimization problem. I: Procedure (Q1102855) (← links)
- Generalization of Murty's direct algorithm to linear and convex quadratic programming (Q1106739) (← links)
- Rate of convergence of the method of feasible directions, not necessarily using the direction of steepest descent (Q1119473) (← links)
- Partitioning procedures for solving mixed-variables programming problems (Q1131201) (← links)
- A geometrie representation for pairs of dual quadratic or linear programs (Q1131454) (← links)
- An efficient curvilinear method for the minimization of a nonlinear function subject to linear inequality constraints (Q1134629) (← links)
- Observations on a class of nasty linear complementarity problems (Q1141086) (← links)
- Feasible direction method for large-scale nonconvex programs: Decomposition approach (Q1142995) (← links)
- A globally convergent, implementable multiplier method with automatic penalty limitation (Q1145623) (← links)
- Distributed-parameter optimal control via mathematical programming (Q1146117) (← links)
- A cutting-plane algorithm with linear and geometric rates of convergence (Q1147491) (← links)
- New convergence theorems for a class of feasible directions algorithms (Q1151828) (← links)
- An algorithm for linearly constrained nonlinear programming problems (Q1151830) (← links)
- A new solution to optimization-satisfaction problems by a penalty method (Q1156353) (← links)
- Numerical study of some feasible direction methods in mathematical programming (Q1165559) (← links)
- Method of reduction in convex programming (Q1169402) (← links)
- Algorithm model for penalty functions-type iterative pcedures (Q1214742) (← links)
- Decentralized optimization for distributed-lag models of discrete systems (Q1221384) (← links)
- On the rate of convergence of some feasible direction algorithms (Q1221697) (← links)
