Pages that link to "Item:Q5186649"

The following pages link to An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems (Q5186649):

Displaying 16 items.

• An adaptive competitive penalty method for nonsmooth constrained optimization (Q526728) (← links)
• A variable metric method for nonsmooth convex constrained optimization (Q865537) (← links)
• Proximity control in bundle methods for convex nondifferentiable minimization (Q911994) (← links)
• A bundle-filter method for nonsmooth convex constrained optimization (Q959944) (← links)
• A filter-variable-metric method for nonsmooth convex constrained optimization (Q1004165) (← links)
• Penalty-proximal methods in convex programming (Q1091267) (← links)
• A constraint linearization method for nondifferentiable convex minimization (Q1099787) (← links)
• An algorithm for calculating one subgradient of a convex function of two variables (Q1119340) (← links)
• A successive quadratic programming method for a class of constrained nonsmooth optimization problems (Q1174457) (← links)
• Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization (Q1181737) (← links)
• A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (Q1704913) (← links)
• An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems (Q1717575) (← links)
• Limited memory interior point bundle method for large inequality constrained nonsmooth minimization (Q2425996) (← links)
• Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming (Q2817246) (← links)
• Survey of Bundle Methods for Nonsmooth Optimization (Q4806340) (← links)
• A New Sequential Optimality Condition for Constrained Nonsmooth Optimization (Q5114399) (← links)