Pages that link to "Item:Q3773699"

The following pages link to A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems (Q3773699):

Displaying 50 items.

• A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity (Q273251) (← links)
• A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization (Q393748) (← links)
• On the comparative optimal analysis and synthesis of four-bar function generating mechanism using different heuristic methods (Q400204) (← links)
• An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems (Q437832) (← links)
• Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
• An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments (Q531641) (← links)
• The use of QP-free algorithm in the limit analysis of slope stability (Q544226) (← links)
• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity (Q556270) (← links)
• Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions (Q597172) (← links)
• A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization (Q627582) (← links)
• A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization (Q635233) (← links)
• Global and local convergence of a class of penalty-free-type methods for nonlinear programming (Q693410) (← links)
• Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization (Q700746) (← links)
• Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems (Q779870) (← links)
• A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints (Q812423) (← links)
• A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity (Q833162) (← links)
• A modified SQP algorithm for minimax problems (Q837129) (← links)
• An efficient feasible SQP algorithm for inequality constrained optimization (Q837710) (← links)
• A type of efficient feasible SQP algorithms for inequality constrained optimization (Q846474) (← links)
• A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence (Q848564) (← links)
• A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q858741) (← links)
• A simple feasible SQP algorithm for inequality constrained optimization (Q858743) (← links)
• A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints (Q861188) (← links)
• An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization (Q938022) (← links)
• A quadratically approximate framework for constrained optimization, global and local convergence (Q943517) (← links)
• A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization (Q988435) (← links)
• A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization (Q1004010) (← links)
• An SQP algorithm for mathematical programs with nonlinear complementarity constraints (Q1030407) (← links)
• Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
• Feasible direction interior-point technique for nonlinear optimization (Q1273166) (← links)
• An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point (Q1367215) (← links)
• New sequential quadratic programming algorithm with consistent subproblems (Q1368267) (← links)
• A generalized projection-successive linear equations algorithm for nonlinearly equality and inequality constrained optimization and its rate of convergence (Q1370303) (← links)
• Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints (Q1372561) (← links)
• A new SQP method of feasible directions for nonlinear programming. (Q1415268) (← links)
• A feasible and superlinear algorithm for inequality constrained minimization problems (Q1568229) (← links)
• A superlinearly and quadratically convergent SQP type feasible method for constrained optimization (Q1589812) (← links)
• A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
• An efficient sequential quadratic programming algorithm for nonlinear programming (Q1765487) (← links)
• A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity (Q1765848) (← links)
• A superlinearly convergent numerical algorithm for nonlinear programming (Q1926210) (← links)
• An improved feasible QP-free algorithm for inequality constrained optimization (Q1941312) (← links)
• An ADMM-based SQP method for separably smooth nonconvex optimization (Q2069362) (← links)
• A global QP-free algorithm for mathematical programs with complementarity constraints (Q2069554) (← links)
• A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization (Q2088141) (← links)
• A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application (Q2226311) (← links)
• A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences (Q2252398) (← links)
• An improved sequential quadratic programming algorithm for solving general nonlinear programming problems (Q2257747) (← links)
• A feasible SQP method for nonlinear programming (Q2266975) (← links)
• Improved filter-SQP algorithm with active set for constrained minimax problems (Q2336309) (← links)