A subgradient-based convex approximations method for DC programming and its applications
From MaRDI portal
Publication:2358301
DOI10.3934/jimo.2016.12.1349zbMath1364.90272OpenAlexW2524285514MaRDI QIDQ2358301
Jian Gu, Xiantao Xiao, Li-wei Zhang
Publication date: 14 June 2017
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2016.12.1349
Nonconvex programming, global optimization (90C26) Numerical methods based on necessary conditions (49M05) Set-valued and variational analysis (49J53)
Related Items
A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence ⋮ The modified second APG method for DC optimization problems
Cites Work
- Unnamed Item
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- A smoothing function approach to joint chance-constrained programs
- Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets
- Nonsmooth analysis
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- DC programming: overview.
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A sequential convex program method to DC program with joint chance constraints
- Optimization based DC programming and DCA for hierarchical clustering
- Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
- Lectures on Stochastic Programming
- Variational Analysis
- Transmit beamforming for physical-layer multicasting
- Convex Approximations of Chance Constrained Programs
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
This page was built for publication: A subgradient-based convex approximations method for DC programming and its applications
