Pages that link to "Item:Q2277155"

The following pages link to Exact penalty function algorithm with simple updating of the penalty parameter (Q2277155):

Displaying 23 items.

• A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity (Q273251) (← links)
• A reduced Hessian SQP method for inequality constrained optimization (Q540630) (← links)
• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity (Q556270) (← links)
• A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
• A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints (Q668747) (← links)
• A modified SQP algorithm for minimax problems (Q837129) (← links)
• A simple feasible SQP algorithm for inequality constrained optimization (Q858743) (← links)
• A cautious BFGS update for reduced Hessian SQP (Q885498) (← links)
• A smoothing QP-free infeasible method for nonlinear inequality constrained optimization (Q933072) (← links)
• An SQP algorithm with cautious updating criteria for nonlinear degenerate problems (Q1036891) (← links)
• An SQP method for general nonlinear programs using only equality constrained subproblems (Q1290629) (← links)
• A new technique for inconsistent QP problems in the SQP method (Q1298765) (← links)
• A two-parameter exact penalty function for nonlinear programming (Q1337206) (← links)
• An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point (Q1367215) (← links)
• A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
• An improved sequential quadratic programming algorithm for solving general nonlinear programming problems (Q2257747) (← links)
• A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems (Q2435607) (← links)
• A sequential quadratically constrained quadratic programming method of feasible directions (Q2480785) (← links)
• Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems (Q2483248) (← links)
• An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity (Q2485397) (← 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 superlinearly convergent hybrid algorithm for solving nonlinear programming (Q2628199) (← links)