Pages that link to "Item:Q5317553"

The following pages link to An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter (Q5317553):

Displaying 48 items.

• A doubly stabilized bundle method for nonsmooth convex optimization (Q263188) (← links)
• Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
• Solving generation expansion planning problems with environmental constraints by a bundle method (Q373184) (← links)
• A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization (Q393748) (← links)
• Level bundle methods for constrained convex optimization with various oracles (Q404512) (← links)
• Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
• Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
• Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions (Q831364) (← links)
• A variable metric method for nonsmooth convex constrained optimization (Q865537) (← 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)
• 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)
• A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods (Q1986106) (← 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)
• 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)
• A penalty-free method with superlinear convergence for equality constrained optimization (Q2191791) (← links)
• An incremental bundle method for portfolio selection problem under second-order stochastic dominance (Q2200800) (← links)
• Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality (Q2251554) (← links)
• A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems (Q2307749) (← links)
• A proximal-projection partial bundle method for convex constrained minimax problems (Q2313762) (← links)
• An approximate proximal bundle method to minimize a class of maximum eigenvalue functions (Q2336811) (← links)
• A simple version of bundle method with linear programming (Q2419511) (← links)
• Limited memory interior point bundle method for large inequality constrained nonsmooth minimization (Q2425996) (← links)
• Optimistic planning algorithms for state-constrained optimal control problems (Q2667972) (← links)
• A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems (Q2694519) (← links)
• Spectral projected subgradient method for nonsmooth convex optimization problems (Q2700023) (← links)
• An implementation of a reduced subgradient method via Luenberger-Mokhtar variant (Q2817227) (← links)
• Diagonal discrete gradient bundle method for derivative free nonsmooth optimization (Q2817235) (← links)
• Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming (Q2817246) (← links)
• Subgradient and Bundle Methods for Nonsmooth Optimization (Q2838345) (← links)
• Comparing different nonsmooth minimization methods and software (Q2885467) (← links)
• An Algorithm Using Trust Region Strategy for Minimization of a Nondifferentiable Function (Q3114592) (← links)
• Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization (Q3145057) (← links)
• A sharp augmented Lagrangian-based method in constrained non-convex optimization (Q4631763) (← links)
• (Q5037959) (← links)
• A splitting bundle approach for non-smooth non-convex minimization (Q5248228) (← links)
• On the generalization of ECP and OA methods to nonsmooth convex MINLP problems (Q5495574) (← links)
• A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization (Q5865916) (← links)
• A proximal bundle method for nonsmooth nonconvex functions with inexact information (Q5963307) (← links)
• A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information (Q6059582) (← links)
• A version of bundle trust region method with linear programming (Q6086138) (← links)
• Optimal Convergence Rates for the Proximal Bundle Method (Q6155876) (← links)