Pages that link to "Item:Q4194754"

The following pages link to Combined phase I—phase II methods of feasible directions (Q4194754):

Displaying 30 items.

• Substitution secant/finite difference method to large sparse minimax problems (Q380609) (← links)
• A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization (Q393748) (← links)
• Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
• A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization (Q646746) (← links)
• Nondifferentiable optimization algorithm for designing control systems having singular value inequalities (Q788989) (← links)
• Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions (Q831364) (← 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 strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints (Q861188) (← links)
• Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
• A quadratically convergent algorithm for solving infinite dimensional inequalities (Q1056201) (← links)
• Enhanced methods for feasible directions for engineering design problems (Q1068727) (← links)
• A robust secant method for optimization problems with inequality constraints (Q1136347) (← links)
• New convergence theorems for a class of feasible directions algorithms (Q1151828) (← links)
• Regularizing the abstract convex program (Q1156085) (← links)
• Computer-aided design via optimization: A review (Q1161482) (← links)
• A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization (Q1205504) (← links)
• Algorithms for a class of computer-aided design problems: A review (Q1260353) (← links)
• A generalization of the norm-relaxed method of feasible directions (Q1294211) (← links)
• On a class fo hybrid methods for smooth constrained optimization (Q1321193) (← links)
• A generalized gradient projection method for optimization problems with equality and inequality constraints about arbitrary initial point (Q1920019) (← links)
• An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods (Q2089775) (← links)
• Superlinearly convergent algorithm for min-max problems (Q2277156) (← links)
• A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization (Q2510002) (← links)
• A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q2572648) (← links)
• A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization (Q3506289) (← links)
• An application-oriented, optimization-based methodology for interactive design of engineering systems† (Q3727758) (← links)
• Combined phase I—phase II methods of feasible directions (Q4194754) (← links)
• An Adaptive Smoothing Method for Continuous Minimax Problems (Q5245835) (← links)
• Preface (Q5965505) (← links)