Pages that link to "Item:Q2392661"

The following pages link to A penalty-interior-point algorithm for nonlinear constrained optimization (Q2392661):

Displaying 13 items.

• A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs (Q781112) (← links)
• An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization (Q898716) (← links)
• A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm (Q1650852) (← links)
• A double-layer optimization model for flatness control of cold rolled strip (Q2056624) (← links)
• A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs (Q2105288) (← links)
• Learning to steer nonlinear interior-point methods (Q2175369) (← links)
• First- and second-order necessary conditions via exact penalty functions (Q2349834) (← links)
• On the augmented subproblems within sequential methods for nonlinear programming (Q2403109) (← links)
• An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities (Q2420776) (← links)
• Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization (Q5198049) (← links)
• A globally convergent primal-dual interior-point relaxation method for nonlinear programs (Q5216730) (← links)
• Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization (Q6126655) (← links)
• An overview of nonlinear optimization (Q6200213) (← links)