Pages that link to "Item:Q481058"

The following pages link to Constrained nonconvex nonsmooth optimization via proximal bundle method (Q481058):

Displaying 14 items.

• 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 new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization (Q2007826) (← links)
• A filter proximal bundle method for nonsmooth nonconvex constrained optimization (Q2022218) (← links)
• An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information (Q2031374) (← 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)
• A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming (Q2129642) (← links)
• An approximate bundle method for solving nonsmooth equilibrium problems (Q2399480) (← links)
• A new global optimization technique by auxiliary function method in a directional search (Q2414113) (← links)
• A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems (Q2694519) (← links)
• A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information (Q6059582) (← links)
• A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective (Q6093282) (← links)
• New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information (Q6093975) (← links)