Pages that link to "Item:Q5963307"

The following pages link to A proximal bundle method for nonsmooth nonconvex functions with inexact information (Q5963307):

Displaying 50 items.

• Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
• Nonconvex bundle method with application to a delamination problem (Q316176) (← links)
• An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems (Q824547) (← links)
• A discussion of probability functions and constraints from a variational perspective (Q829489) (← links)
• A discussion on variational analysis in derivative-free optimization (Q829491) (← 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)
• Regularized decomposition of large scale block-structured robust optimization problems (Q1789623) (← links)
• A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming (Q1983659) (← links)
• A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization (Q2007826) (← links)
• An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity (Q2020598) (← links)
• A filter proximal bundle method for nonsmooth nonconvex constrained optimization (Q2022218) (← links)
• A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions (Q2023656) (← links)
• A bundle method for nonsmooth DC programming with application to chance-constrained problems (Q2028493) (← links)
• An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information (Q2031374) (← links)
• A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data (Q2066220) (← 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)
• Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems (Q2136887) (← links)
• An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems (Q2150773) (← links)
• A multi-step doubly stabilized bundle method for nonsmooth convex optimization (Q2177698) (← links)
• Alternating forward-backward splitting for linearly constrained optimization problems (Q2191282) (← links)
• An incremental bundle method for portfolio selection problem under second-order stochastic dominance (Q2200800) (← links)
• Proximal bundle methods for nonsmooth DC programming (Q2274891) (← links)
• Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions (Q2315256) (← links)
• An approximate bundle method for solving nonsmooth equilibrium problems (Q2399480) (← links)
• Computing proximal points of convex functions with inexact subgradients (Q2413568) (← links)
• A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems (Q2414914) (← links)
• A simple version of bundle method with linear programming (Q2419511) (← 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)
• A sharp augmented Lagrangian-based method in constrained non-convex optimization (Q4631763) (← links)
• A Redistributed Bundle Algorithm for Generalized Variational Inequality Problems in Hilbert Spaces (Q4689377) (← links)
• On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle (Q5024906) (← links)
• An Inexact Bundle Method and Subgradient Computations for Optimal Control of Deterministic and Stochastic Obstacle Problems (Q5051790) (← links)
• Optimization conditions and decomposable algorithms for convertible nonconvex optimization (Q5058177) (← links)
• A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions (Q5058380) (← links)
• Adaptive Bundle Methods for Nonlinear Robust Optimization (Q5106409) (← links)
• The chain rule for VU-decompositions of nonsmooth functions (Q5110185) (← links)
• A derivative-free 𝒱𝒰-algorithm for convex finite-max problems (Q5113714) (← links)
• Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions (Q5162654) (← links)
• An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space (Q5193505) (← links)
• Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems (Q5860819) (← links)
• A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization (Q5865916) (← links)
• A Trust-region Method for Nonsmooth Nonconvex Optimization (Q5881403) (← links)
• A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods (Q5883316) (← links)
• A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions (Q5883328) (← 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)