Computing B-Stationary Points of Nonsmooth DC Programs (Q2976143): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A New Decomposition Method for Multiuser DC-Programming and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convex quadratic programs with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conic QPCCs, conic QCQPs and completely positive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Selective Algorithms for Nonconvex Big Data Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Convex Counterexamples: A Discontinuous Envelope Function and a Nondifferentiable Nearest-Point Mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving linear complementarity problems by DC programming and DCA / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC Programming and DCA for General DC Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact penalty and error bounds in DC programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3410053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of New Inertial Proximal Methods for DC Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the difference of two maximal monotone operators: Regularization and algorithmic approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially B-Regular Optimization and Equilibrium Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconvex Games with Side Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On almost smooth functions and piecewise smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Joint Base Station Assignment and Beamforming for Heterogeneous Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconvex Structures in Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directionally nondifferentiable metric projection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof of Convergence of the Concave-Convex Procedure Using Zangwill's Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of a difference of two convex functions / rank
 
Normal rank

Latest revision as of 16:07, 13 July 2024

scientific article
Language Label Description Also known as
English
Computing B-Stationary Points of Nonsmooth DC Programs
scientific article

    Statements

    Computing B-Stationary Points of Nonsmooth DC Programs (English)
    0 references
    0 references
    0 references
    0 references
    13 April 2017
    0 references
    nonsmooth DC programming
    0 references
    DC constraints
    0 references
    DC algorithm
    0 references
    stationary solutions
    0 references
    Bouligand derivatives
    0 references
    randomization
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references