Pages that link to "Item:Q1181737"

The following pages link to Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization (Q1181737):

Displaying 27 items.

• Solving generation expansion planning problems with environmental constraints by a bundle method (Q373184) (← links)
• Coupling the gradient method with a general exterior penalization scheme for convex minimization (Q415412) (← links)
• Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
• Constrained nonconvex nonsmooth optimization via proximal bundle method (Q481058) (← links)
• A quasisecant method for solving a system of nonsmooth equations (Q524563) (← links)
• A fast space-decomposition scheme for nonconvex eigenvalue optimization (Q526388) (← links)
• An adaptive competitive penalty method for nonsmooth constrained optimization (Q526728) (← links)
• A variable metric method for nonsmooth convex constrained optimization (Q865537) (← links)
• Computing proximal points of nonconvex functions (Q959941) (← links)
• A bundle-filter method for nonsmooth convex constrained optimization (Q959944) (← links)
• A filter-variable-metric method for nonsmooth convex constrained optimization (Q1004165) (← links)
• An inexact bundle variant suited to column generation (Q1016116) (← links)
• Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results (Q1319860) (← links)
• Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization (Q1664251) (← links)
• An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions (Q1665008) (← 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)
• A feasible point method with bundle modification for nonsmooth convex constrained optimization (Q1753350) (← links)
• Approximations in proximal bundle methods and decomposition of convex programs (Q1893328) (← links)
• A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods (Q1986106) (← links)
• A new restricted memory level bundle method for constrained convex nonsmooth optimization (Q2080833) (← links)
• A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization (Q2104108) (← links)
• Dynamic bundle methods (Q2390994) (← links)
• Limited memory interior point bundle method for large inequality constrained nonsmooth minimization (Q2425996) (← links)
• An implementation of a reduced subgradient method via Luenberger-Mokhtar variant (Q2817227) (← links)
• Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming (Q2817246) (← links)
• A varying-parameter fixed-time gradient-based dynamic network for convex optimization (Q6091316) (← links)