Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
From MaRDI portal
Publication:5379467
DOI10.1080/10556788.2019.1595619zbMath1417.49016OpenAlexW2929787504MaRDI QIDQ5379467
Welington de Oliveira, Wim van Ackooij
Publication date: 12 June 2019
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2019.1595619
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)
Related Items
The ABC of DC programming ⋮ Addendum to the paper ‘Nonsmooth DC-constrained optimization: constraint qualification and minimizing methodologies’ ⋮ DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints ⋮ A bundle method for nonsmooth DC programming with application to chance-constrained problems ⋮ Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On local search in d.c. optimization problems
- Global convergence of a proximal linearized algorithm for difference of convex functions
- Level bundle methods for constrained convex optimization with various oracles
- Exact penalty and error bounds in DC programming
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- On probabilistic constraints induced by rectangular sets and multivariate normal distributions
- Duality in nonconvex optimization
- Handbook of test problems in local and global optimization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Exact penalty in d. c. programming
- Large-scale unit commitment under uncertainty: an updated literature survey
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- A local search method for optimization problem with d.c. inequality constraints
- Large-scale unit commitment under uncertainty
- Joint chance constrained programming for hydro reservoir management
- Variations and extension of the convex-concave procedure
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- On M-stationarity conditions in MPECs and the associated qualification conditions
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- Level bundle methods for oracles with on-demand accuracy
- Computing B-Stationary Points of Nonsmooth DC Programs
- Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems
- DC Programming and DCA for General DC Programs
- On the numerical solution of a class of Stackelberg problems
- Lectures on Stochastic Programming
- Exact penalty functions in nonlinear programming
- Bilevel Programming Problems
- Partially B-Regular Optimization and Equilibrium Problems
- Non-Linear Programming Via Penalty Functions
- Convex analysis and global optimization
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
