A Redistributed Proximal Bundle Method for Nonconvex Optimization

From MaRDI portal
Publication:3083294


DOI10.1137/090754595zbMath1211.90183OpenAlexW1988832226MaRDI QIDQ3083294

No author found.

Publication date: 21 March 2011

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090754595



Related Items

A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods, A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions, An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems, A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming, Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems, A new trust region method for nonsmooth nonconvex optimization, Optimization conditions and decomposable algorithms for convertible nonconvex optimization, Best practices for comparing optimization algorithms, An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems, Non-smooth optimization for robust control of infinite-dimensional systems, A proximal alternating linearization method for nonconvex optimization problems, Subgradient method for nonconvex nonsmooth optimization, Composite proximal bundle method, An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions, Computing proximal points of convex functions with inexact subgradients, A simple version of bundle method with linear programming, Cutting plane oracles to minimize non-smooth non-convex functions, A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information, Generalized order-value optimization, A version of bundle trust region method with linear programming, Adaptive Bundle Methods for Nonlinear Robust Optimization, A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective, New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information, Improving an upper bound on the size of \(k\)-regular induced subgraphs, Optimal Convergence Rates for the Proximal Bundle Method, A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems, A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities, A Support Function Based Algorithm for Optimization with Eigenvalue Constraints, A decomposition method with redistributed subroutine for constrained nonconvex optimization, A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information, Unnamed Item, An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems, Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization, A sharp augmented Lagrangian-based method in constrained non-convex optimization, Constrained nonconvex nonsmooth optimization via proximal bundle method, Diagonal bundle method for nonsmooth sparse optimization, A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming, A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods, Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions, Derivative-free optimization via proximal point methods, Aggregate subgradient method for nonsmooth DC optimization, A convergence analysis of the method of codifferential descent, A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization, Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions, Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values, The chain rule for VU-decompositions of nonsmooth functions, A filter proximal bundle method for nonsmooth nonconvex constrained optimization, Proximal bundle methods for nonsmooth DC programming, An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space, Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity, An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information, A Redistributed Bundle Algorithm for Generalized Variational Inequality Problems in Hilbert Spaces, A proximal bundle method for nonsmooth nonconvex functions with inexact information, Derivative-free robust optimization by outer approximations, Essentials of numerical nonsmooth optimization, Minimizing Piecewise-Concave Functions Over Polyhedra, A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data, Inexact proximal point methods in metric spaces, Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems, Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions, A splitting bundle approach for non-smooth non-convex minimization, Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems, Essentials of numerical nonsmooth optimization, A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization, A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization, Aggregate codifferential method for nonsmooth DC optimization, Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization, Nonsmooth bundle trust-region algorithm with applications to robust stability


Uses Software