Pages that link to "Item:Q4769896"

The following pages link to Rate of Convergence of a Class of Methods of Feasible Directions (Q4769896):

Displaying 33 items.

• Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052) (← links)
• A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization (Q646746) (← links)
• A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization (Q742307) (← links)
• A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q858741) (← links)
• A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints (Q861188) (← links)
• Optimal scheduling of reservoir releases during flood: Deterministic optimization problem. I: Procedure (Q1102855) (← links)
• Rate of convergence of the method of feasible directions, not necessarily using the direction of steepest descent (Q1119473) (← links)
• New convergence theorems for a class of feasible directions algorithms (Q1151828) (← links)
• Numerical study of some feasible direction methods in mathematical programming (Q1165559) (← links)
• On the rate of convergence of some feasible direction algorithms (Q1221697) (← links)
• Minimization methods with constraints (Q1234628) (← links)
• An outer approximations algorithm for computer-aided design problems (Q1250031) (← links)
• A feasible direction algorithm for convex optimization: Global convergence rates (Q1252156) (← links)
• Algorithms for a class of computer-aided design problems: A review (Q1260353) (← links)
• The computation of the Nash bargaining solution (Q1264100) (← links)
• Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD (Q1280097) (← links)
• A generalization of the norm-relaxed method of feasible directions (Q1294211) (← links)
• Norm-relaxed method of feasible directions for solving nonlinear programming problems (Q1338556) (← links)
• Convergence analysis of norm-relaxed method of feasible directions (Q1359453) (← links)
• Self-tuning norm-relaxed method of feasible directions (Q1367804) (← links)
• Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
• New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate (Q2370024) (← links)
• Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints (Q2372939) (← links)
• A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming (Q2462105) (← links)
• A sequential quadratically constrained quadratic programming method of feasible directions (Q2480785) (← links)
• A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q2572648) (← links)
• A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization (Q2841139) (← links)
• A globally convergent sequential linear programming algorithm for mathematical programs with linear complementarity constraints (Q3008599) (← links)
• An interior point method for nonlinear programming (Q4184632) (← links)
• Combined phase I—phase II methods of feasible directions (Q4194754) (← links)
• On optimum design in fluid mechanics (Q4766714) (← links)
• An active set sequential quadratic programming algorithm for nonlinear optimisation (Q5482578) (← links)
• A superlinearly convergent method of feasible directions. (Q5931665) (← links)