Computing B-stationary points of nonsmooth DC programs
From MaRDI portal
Abstract: Motivated by a class of applied problems arising from physical layer based security in a digital communication system, in particular, by a secrecy sum-rate maximization problem, this paper studies a nonsmooth, difference-of-convex (dc) minimization problem. The contributions of this paper are: (i) clarify several kinds of stationary solutions and their relations; (ii) develop and establish the convergence of a novel algorithm for computing a d-stationary solution of a problem with a convex feasible set that is arguably the sharpest kind among the various stationary solutions; (iii) extend the algorithm in several directions including: a randomized choice of the subproblems that could help the practical convergence of the algorithm, a distributed penalty approach for problems whose objective functions are sums of dc functions, and problems with a specially structured (nonconvex) dc constraint. For the latter class of problems, a pointwise Slater constraint qualification is introduced that facilitates the verification and computation of a B(ouligand)-stationary point.
Recommendations
- Penalty and augmented Lagrangian methods for constrained DC programming
- Proximal bundle methods for nonsmooth DC programming
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- An inertial algorithm for DC programming
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
Cites work
- A New Decomposition Method for Multiuser DC-Programming and Its Applications
- A proof of convergence of the concave-convex procedure using Zangwill's theory
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
- Convergence of New Inertial Proximal Methods for DC Programming
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- DC programming and DCA for general DC programs
- Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
- Directionally nondifferentiable metric projection
- Exact penalty and error bounds in DC programming
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Global minimization of a difference of two convex functions
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Nonconvex Structures in Nonlinear Programming
- Nonconvex games with side constraints
- OPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
- On almost smooth functions and piecewise smooth functions
- On conic QPCCs, conic QCQPs and completely positive programs
- On convex quadratic programs with linear complementarity constraints
- On solving linear complementarity problems by DC programming and DCA
- On the convergence of an approximate proximal method for DC functions
- On the difference of two maximal monotone operators: Regularization and algorithmic approaches
- Optimal Joint Base Station Assignment and Beamforming for Heterogeneous Networks
- Parallel Selective Algorithms for Nonconvex Big Data Optimization
- Partially B-Regular Optimization and Equilibrium Problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Two Convex Counterexamples: A Discontinuous Envelope Function and a Nondifferentiable Nearest-Point Mapping
Cited in
(89)- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
- An accelerated semi-proximal ADMM with applications to multi-block sparse optimization problems
- An inexact Bregman proximal difference-of-convex algorithm with two types of relative stopping criteria
- The ABC of DC programming
- Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm
- Contractive difference-of-convex algorithms
- Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems
- On the pervasiveness of difference-convexity in optimization and statistics
- Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
- A generalized formulation for group selection via ADMM
- On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression
- An inexact proximal linearized DC algorithm with provably terminating inner loop
- An augmented subgradient method for minimizing nonsmooth DC functions
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- Composite difference-MAX programs for modern statistical estimation problems
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems
- Solving Nonsmooth and Nonconvex Compound Stochastic Programs with Applications to Risk Measure Minimization
- DC programming and DCA: thirty years of developments
- Asymptotic Properties of Stationary Solutions of Coupled Nonconvex Nonsmooth Empirical Risk Minimization
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
- A refined inertial DC algorithm for DC programming
- Robust multicategory support vector machines using difference convex algorithm
- Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs
- A DCA-Newton method for quartic minimization over the sphere
- Decomposition methods for computing directional stationary solutions of a class of nonsmooth nonconvex optimization problems
- Lifted stationary points of sparse optimization with complementarity constraints
- Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations
- On the rate of convergence of the difference-of-convex algorithm (DCA)
- Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound
- Neural network for a class of sparse optimization with \(L_0\)-regularization
- Iteratively reweighted group Lasso based on log-composite regularization
- A proximal-type method for nonsmooth and nonconvex constrained minimization problems
- Sequential difference-of-convex programming
- Multicomposite nonconvex optimization for training deep neural networks
- Proximal bundle methods for nonsmooth DC programming
- A bundle method for nonsmooth DC programming with application to chance-constrained problems
- Nonconvex robust programming via value-function optimization
- An inertial algorithm for DC programming
- Piecewise affine parameterized value-function based bilevel non-cooperative games
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- A general double-proximal gradient algorithm for d.c. programming
- A global two-stage algorithm for non-convex penalized high-dimensional linear regression problems
- The DTC (difference of tangentially convex functions) programming: optimality conditions
- Study on \(L_1\) over \(L_2\) Minimization for nonnegative signal recovery
- Computation of the maximum likelihood estimator in low-rank factor analysis
- Structural properties of affine sparsity constraints
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- Short paper -- A note on the Frank-Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems
- scientific article; zbMATH DE number 7306909 (Why is no real title available?)
- Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization
- A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations
- Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems
- Two-Stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse
- Penalty and augmented Lagrangian methods for constrained DC programming
- Minimizing sequences in a constrained DC optimization problem
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- Open issues and recent advances in DC programming and DCA
- Learning graph Laplacian with MCP
- Some brief observations in minimizing the sum of locally Lipschitzian functions
- Stochastic difference-of-convex-functions algorithms for nonconvex programming
- One way to solve pessimistic bilevel optimization problems
- scientific article; zbMATH DE number 7733439 (Why is no real title available?)
- scientific article; zbMATH DE number 7594592 (Why is no real title available?)
- Several classes of stationary points for rank regularized minimization problems
- Computation of second-order directional stationary points for group sparse optimization
- Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm
- Estimation of individualized decision rules based on an optimized covariate-dependent equivalent of random outcomes
- Quadratic Growth and Linear Convergence of a DCA Method for Quartic Minimization over the Sphere
- Feasible methods for nonconvex nonsmooth problems with applications in green communications
- A four-operator splitting algorithm for nonconvex and nonsmooth optimization
- Addendum to the paper ‘Nonsmooth DC-constrained optimization: constraint qualification and minimizing methodologies’
- Dual randomized coordinate descent method for solving a class of nonconvex problems
- Alternating DC algorithm for partial DC programming problems
- Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints
- Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
- Spherical zone t-designs for numerical integration and approximation
- On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem
- Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity
- Projected gradient descent accumulates at Bouligand stationary points
- On Robustness of Individualized Decision Rules
- Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems
- On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
- Cardinality objective nonlinear programs for facility capacity expansion
- Optimizing power generation in the presence of micro-grids
- On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials
This page was built for publication: Computing B-stationary points of nonsmooth DC programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976143)
