A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
From MaRDI portal
Publication:1704913
DOI10.1007/s10898-017-0565-2zbMath1390.90448OpenAlexW2754366921MaRDI QIDQ1704913
Jian Lv, Li-Ping Pang, Fan-Yun Meng
Publication date: 13 March 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0565-2
nonsmooth optimizationconstrained optimizationnonconvex optimizationproximal bundle methodinexact oracle
Related Items
A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions, Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions, A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming, Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions, An Inexact Bundle Method and Subgradient Computations for Optimal Control of Deterministic and Stochastic Obstacle Problems, An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems, A multi-step doubly stabilized bundle method for nonsmooth convex optimization, Adaptive Bundle Methods for Nonlinear Robust Optimization, Optimal Convergence Rates for the Proximal Bundle Method, A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems, Filter trust region method for nonlinear semi-infinite programming problem, A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization, A filter proximal bundle method for nonsmooth nonconvex constrained optimization, An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information, Nonsmooth Optimization Method for H∞ Output Feedback Control, A new adaptive method to nonlinear semi-infinite programming, A new restricted memory level bundle method for constrained convex nonsmooth optimization, Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- On approximations with finite precision in bundle methods for nonsmooth optimization
- On constraint qualifications in nonsmooth optimization.
- Convex analysis and nonlinear optimization. Theory and examples.
- Computing proximal points of nonconvex functions
- A bundle-filter method for nonsmooth convex constrained optimization
- Incremental-like bundle methods with application to energy planning
- An inexact bundle variant suited to column generation
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Error stability properties of generalized gradient-type algorithms
- Generalized semi-infinite optimization: A first order optimality condition and examples
- A bundle-Newton method for nonsmooth unconstrained minimization
- Bi-level strategies in semi-infinite programming.
- Approximate convexity and submonotonicity.
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
- A quasi-second-order proximal bundle algorithm
- New variants of bundle methods
- The effect of deterministic noise in subgradient methods
- Methods of descent for nondifferentiable optimization
- Solving two-stage stochastic programming problems with level decomposition
- A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- A New Exchange Method for Convex Semi-Infinite Programming
- Inexact Bundle Methods for Two-Stage Stochastic Programming
- Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization
- A Linearization Algorithm for Nonsmooth Minimization
- An Algorithm for Nonsmooth Convex Minimization With Errors
- A cutting-plane method for quadratic semi infinite programming problems
- Submonotone Subdifferentials of Lipschitz Functions
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- An Algorithm for Constrained Optimization with Semismooth Functions
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- Variational Analysis
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
- Computation of the distance to semi-algebraic sets
- An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
- Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values
- A proximal bundle method based on approximate subgradients
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
