Pages that link to "Item:Q4745623"

The following pages link to Globally Convergent Algorithms for Convex Programming (Q4745623):

Displaying 8 items.

• An M-objective penalty function algorithm under big penalty parameters (Q328083) (← links)
• The complexity of routing in~hierarchical PNNI networks (Q374679) (← links)
• On the smoothing of the square-root exact penalty function for inequality constrained optimization (Q861516) (← links)
• An objective penalty function method for nonlinear programming. (Q1764582) (← links)
• An objective penalty function method for biconvex programming (Q2052381) (← links)
• Exactness and algorithm of an objective penalty function (Q2392750) (← links)
• A Smoothing Objective Penalty Function Algorithm for Inequality Constrained Optimization Problems (Q3173503) (← links)
• Exact penalty functions and stability in locally Lipschitz programming (Q3714912) (← links)