The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems

DOI10.1007/s10479-004-5022-1zbMath1116.90122OpenAlexW1990494141MaRDI QIDQ1772961

Hoai An Le Thi, Tao Pham Dinh

Publication date: 22 April 2005

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-004-5022-1

zbMATH Keywords

DC programmingglobal optimality conditionsregularization techniquesDC algorithms (DCA)local optimality conditionsDC dualitypolyhedral DC programming

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26)

Related Items

Robust spherical separation ⋮ A DC approach for minimax fractional optimization programs with ratios of convex functions ⋮ Robust piecewise linear L₁-regression via nonsmooth DC optimization ⋮ Composite Difference-Max Programs for Modern Statistical Estimation Problems ⋮ Image Segmentation via Fischer-Burmeister Total Variation and Thresholding ⋮ Convexification with Bounded Gap for Randomly Projected Quadratic Optimization ⋮ Simultaneous Grouping Pursuit and Feature Selection Over an Undirected Graph ⋮ Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity ⋮ Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines ⋮ A random covariance model for bi‐level graphical modeling with application to resting‐state fMRI data ⋮ Center-Augmented ℓ2-Type Regularization for Subgroup Learning ⋮ A mesh‐based partitioning algorithm for decreasing conservatism in solving bilinear matrix inequality problems ⋮ Bilinear matrix inequality‐based nonquadratic controller design for polytopic‐linear parameter varying systems ⋮ Adaptively weighted difference model of anisotropic and isotropic total variation for image denoising ⋮ Finding robust minimizer for non-convex phase retrieval ⋮ Learning Markov Models Via Low-Rank Optimization ⋮ The descent algorithm for solving the symmetric eigenvalue complementarity problem ⋮ Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum ⋮ Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints ⋮ Sorted \(L_1/L_2\) minimization for sparse signal recovery ⋮ Strong substitutes: structural properties, and a new algorithm for competitive equilibrium prices ⋮ A wonderful triangle in compressed sensing ⋮ A Based-DC Programming Approach for Planning a Multisensor Multizone Search for a Moving Target ⋮ A DC Algorithm for Solving Quadratic-linear Bilevel Optimization Problems ⋮ A DC Programming Approach for Sparse Estimation of a Covariance Matrix ⋮ A New Approach for Optimizing Traffic Signals in Networks Considering Rerouting ⋮ Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming ⋮ The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results ⋮ Implicit regularization effects of the Sobolev norms in image processing ⋮ Semi-supervised \(k\)-means clustering via DC programming approach ⋮ Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm ⋮ Structured model selection via ℓ1−ℓ2 optimization ⋮ First order inertial optimization algorithms with threshold effects associated with dry friction ⋮ DCA approaches for simultaneous wireless information power transfer in MISO secrecy channel ⋮ A refined inertial DC algorithm for DC programming ⋮ LARGE SYSTEM OF SEEMINGLY UNRELATED REGRESSIONS: A PENALIZED QUASI-MAXIMUM LIKELIHOOD ESTIMATION PERSPECTIVE ⋮ On solving difference of convex functions programs with linear complementarity constraints ⋮ A Nonlocal Graph-PDE and Higher-Order Geometric Integration for Image Labeling ⋮ A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems ⋮ A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program ⋮ Solving nonmonotone affine variational inequalities problem by DC programming and DCA ⋮ On a solution method in indefinite quadratic programming under linear constraints ⋮ Open issues and recent advances in DC programming and DCA ⋮ Likelihood Ratio Tests for a Large Directed Acyclic Graph ⋮ One-dimensional phase retrieval: regularization, box relaxation and uniqueness ⋮ Block Clustering Based on Difference of Convex Functions (DC) Programming and DC Algorithms ⋮ Spontaneous Clustering via Minimum Gamma-Divergence ⋮ Online Learning Based on Online DCA and Application to Online Classification ⋮ Efficient Nonnegative Matrix Factorization by DC Programming and DCA ⋮ DC Algorithm for Extended Robust Support Vector Machine ⋮ Sparse Covariance Matrix Estimation by DCA-Based Algorithms ⋮ A DC Programming Approach for Finding Communities in Networks ⋮ On Recent Progress in Shakedown Analysis and Applications to Large-Scale Problems ⋮ Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms ⋮ Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems ⋮ Extension of primal-dual interior point methods to diff-convex problems on symmetric cones ⋮ Quantile Regression for Analyzing Heterogeneity in Ultra-High Dimension ⋮ Calibrating low-rank correlation matrix problem: an SCA-based approach ⋮ Optimization-based stability analysis of structures under unilateral constraints ⋮ Sequential Convex Programming for Computing Information-Theoretic Minimal Partitions: Nonconvex Nonsmooth Optimization ⋮ Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming ⋮ DC programming approaches for discrete portfolio optimization under concave transaction costs ⋮ Optimizing sensor cover energy via DC programming ⋮ On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods ⋮ Foreword ⋮ Essentials of numerical nonsmooth optimization ⋮ DC programming approach for portfolio optimization under step increasing transaction costs ⋮ Stochastic DCA for Sparse Multiclass Logistic Regression ⋮ DC Programming and DCA for Enhancing Physical Layer Security in Amplify-and-Forward Relay Beamforming Networks Based on the SNR Approach ⋮ Single Straddle Carrier Routing Problem in Port Container Terminals: Mathematical Model and Solving Approaches ⋮ A DC Programming Approach for Mixed-Integer Linear Programs ⋮ Design of Highly Nonlinear Balanced Boolean Functions Using an Hybridation of DCA and Simulated Annealing Algorithm ⋮ Two-Stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse ⋮ On Algorithms for Difference of Monotone Operators ⋮ On Algorithms for Difference of Monotone Operators ⋮ The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions ⋮ An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels ⋮ DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology ⋮ New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions ⋮ The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings ⋮ Algorithmic versatility of SPF-regularization methods ⋮ Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction ⋮ Unnamed Item ⋮ Essentials of numerical nonsmooth optimization ⋮ Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise ⋮ New Splitting Algorithms for Multiplicative Noise Removal Based on Aubert-Aujol Model ⋮ Asymptotic Properties of Stationary Solutions of Coupled Nonconvex Nonsmooth Empirical Risk Minimization ⋮ Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming ⋮ A subgradient-based convex approximations method for DC programming and its applications ⋮ Solving partitioning-hub location-routing problem using DCA ⋮ Alternating DC algorithm for partial DC programming problems ⋮ Solving continuous min max problem for single period portfolio selection with discrete constraints by DCA ⋮ A new semi-supervised classifier based on maximum vector-angular margin ⋮ Training robust support vector regression with smooth non-convex loss function ⋮ A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning ⋮ The DTC (difference of tangentially convex functions) programming: optimality conditions ⋮ A polynomial local optimality condition for the concave piecewise linear network flow problem ⋮ An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming ⋮ DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ A new efficient algorithm based on DC programming and DCA for clustering ⋮ Application of lower bound direct method to engineering structures ⋮ Classification in the multiple instance learning framework via spherical separation ⋮ Sparse signal recovery via generalized Gaussian function ⋮ A continuous DC programming approach to the strategic supply chain design problem from qualified partner set ⋮ Optimization based DC programming and DCA for hierarchical clustering ⋮ A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem ⋮ Large-scale standard pooling problems with constrained pools and fixed demands ⋮ Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs ⋮ DC Programming and DCA for General DC Programs ⋮ DC Programming Approaches for BMI and QMI Feasibility Problems ⋮ A DC Programming Approach for Sparse Linear Discriminant Analysis ⋮ The Confrontation of Two Clustering Methods in Portfolio Management: Ward’s Method Versus DCA Method ⋮ Binary classification via spherical separator by DC programming and DCA ⋮ A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations ⋮ Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation ⋮ A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes ⋮ General variational inclusions involving difference of operators ⋮ Solving the index tracking problem: a continuous optimization approach ⋮ Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring ⋮ A selective strategy for shakedown analysis of engineering structures ⋮ A sub-additive DC approach to the complementarity problem ⋮ The boosted DC algorithm for linearly constrained DC programming ⋮ On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions ⋮ Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm ⋮ Regularized quantile regression for ultrahigh-dimensional data with nonignorable missing responses ⋮ Solution methodologies for minimizing a sum of pointwise minima of two functions ⋮ Clusterwise support vector linear regression ⋮ A DC Programming Approach to the Continuous Equilibrium Network Design Problem ⋮ DC Programming and DCA for Transmit Beamforming and Power Allocation in Multicasting Relay Network ⋮ Solving an Infinite-Horizon Discounted Markov Decision Process by DC Programming and DCA ⋮ An efficient DCA based algorithm for power control in large scale wireless networks ⋮ On solving the sum-of-ratios problem ⋮ Sequential difference-of-convex programming ⋮ Robust regularized extreme learning machine for regression with non-convex loss function via DC program ⋮ An incremental bundle method for portfolio selection problem under second-order stochastic dominance ⋮ A new nonconvex approach for image restoration with Gamma noise ⋮ Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity ⋮ Deep CNN denoiser prior for blurred images restoration with multiplicative noise ⋮ The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions ⋮ A DC programming approach for sensor network localization with uncertainties in anchor positions ⋮ Notes on the difference of two monotone operators ⋮ Computing B-Stationary Points of Nonsmooth DC Programs ⋮ Convergence analysis of a proximal point algorithm for minimizing differences of functions ⋮ A DC programming approach for feature selection in support vector machines learning ⋮ Portfolio optimization model with and without options under additional constraints ⋮ Incremental DC optimization algorithm for large-scale clusterwise linear regression ⋮ DCA-based algorithms for DC fitting ⋮ New quadratic lower bound for multivariate functions in global optimization ⋮ Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions ⋮ DC programming and DCA for enhancing physical layer security via relay beamforming strategies ⋮ A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model ⋮ An augmented subgradient method for minimizing nonsmooth DC functions ⋮ Robust investment strategies with discrete asset choice constraints using DC programming ⋮ One step from DC optimization to DC mixed variational inequalities ⋮ Information projection on Banach spaces with applications to state independent KL-weighted optimal control ⋮ Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning ⋮ A new concave reformulation and its application in solving DC programming globally under uncertain environment ⋮ A continuous approach for the concave cost supply problem via DC programming and DCA ⋮ Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm ⋮ Globally convergent DC trust-region methods ⋮ A difference of convex formulation of value-at-risk constrained optimization ⋮ A closedness condition and its applications to DC programs with convex constraints ⋮ A class of semi-supervised support vector machines by DC programming ⋮ Optical Flow ⋮ An inertial algorithm for DC programming ⋮ Semisupervised spherical separation ⋮ On critical points of the difference of two maximal monotone operators ⋮ Robustness of learning algorithms using hinge loss with outlier indicators ⋮ DC Approximation Approach for ℓ0-minimization in Compressed Sensing ⋮ DC Programming and DCA Approach for Resource Allocation Optimization in OFDMA/TDD Wireless Networks ⋮ DC Programming and DCA for a Novel Resource Allocation Problem in Emerging Area of Cooperative Physical Layer Security ⋮ On DC based methods for phase retrieval ⋮ Feature selection in SVM via polyhedral \(k\)-norm ⋮ Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations ⋮ On functions determined by dense sets ⋮ Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression ⋮ Sequential parametric convex approximation algorithm for bilinear matrix inequality problem ⋮ A difference of convex optimization algorithm for piecewise linear regression ⋮ Split proximal linearized algorithm and convergence theorems for the split DC program ⋮ Analysis of generalized Bregman surrogate algorithms for nonsmooth nonconvex statistical learning ⋮ A DC programming approach for solving a centralized group key management problem ⋮ Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming ⋮ A non-convex algorithm framework based on DC programming and DCA for matrix completion ⋮ Optimal replenishment order placement in a finite time horizon ⋮ Polyhedral separation via difference of convex (DC) programming ⋮ Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem ⋮ Learning sparse classifiers with difference of convex functions algorithms ⋮ K-means clustering via a nonconvex optimization approach ⋮ On the problem polyhedral separability: a numerical solution ⋮ Inertial proximal algorithm for difference of two maximal monotone operators ⋮ Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach ⋮ Hybrid proximal linearized algorithm for the split DC program in infinite-dimensional real Hilbert spaces ⋮ Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization ⋮ MM algorithms for distance covariance based sufficient dimension reduction and sufficient variable selection ⋮ Community detection via an efficient nonconvex optimization approach based on modularity ⋮ Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions ⋮ Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints ⋮ On local search in d.c. optimization problems ⋮ DC programming techniques for solving a class of nonlinear bilevel programs ⋮ DCA based algorithms for multiple sequence alignment (MSA) ⋮ On difference of two monotone operators ⋮ DC approximation approaches for sparse optimization ⋮ Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model ⋮ On numerical solving the spherical separability problem ⋮ Global convergence of a proximal linearized algorithm for difference of convex functions ⋮ Point source super-resolution via non-convex \(L_1\) based methods ⋮ Variational multiplicative noise removal by DC programming ⋮ A DC programming approach for planning a multisensor multizone search for a target ⋮ A continuous DC programming approach for resource allocation in OFDMA/TDD wireless networks ⋮ DC programming and DCA for solving Brugnano-Casulli piecewise linear systems ⋮ DC programming and DCA for enhancing physical layer security via cooperative jamming ⋮ Supervised classification and mathematical optimization ⋮ Homogeneity detection for the high-dimensional generalized linear model ⋮ Optimization with a class of multivariate integral stochastic order constraints ⋮ DCA for solving the scheduling of lifting vehicle in an automated port container terminal ⋮ An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs ⋮ DC models for spherical separation ⋮ A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors ⋮ Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA ⋮ Margin maximization in spherical separation ⋮ Value-at-risk optimization using the difference of convex algorithm ⋮ Global optimization for optimal power flow over transmission networks ⋮ A framework for optimization under ambiguity ⋮ Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms ⋮ On some geometric conditions for minimality of DCH-functions via DC-duality approach ⋮ Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm ⋮ Total Lagrange duality for DC infinite optimization problems ⋮ Algorithms for linear programming with linear complementarity constraints ⋮ Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization ⋮ An efficient DC programming approach for portfolio decision with higher moments ⋮ On solving linear complementarity problems by DC programming and DCA ⋮ Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces ⋮ New and efficient DCA based algorithms for minimum sum-of-squares clustering ⋮ Efficient estimation of approximate factor models via penalized maximum likelihood ⋮ New formulations of the multiple sequence alignment problem ⋮ Properties of two DC algorithms in quadratic programming ⋮ The directional subdifferential of the difference of two convex functions ⋮ Shakedown analysis with multidimensional loading spaces ⋮ Exact penalty and error bounds in DC programming ⋮ A DC programming approach for solving the symmetric eigenvalue complementarity problem ⋮ DC programming algorithm for clusterwise linear \(L_1\) regression ⋮ On global optimization with indefinite quadratics ⋮ Stable zero Lagrange duality for DC conic programming ⋮ A branch-and-bound algorithm embedded with DCA for DC programming ⋮ A combined DCA: GA for constructing highly nonlinear balanced Boolean functions in cryptography ⋮ The space decomposition theory for a class of eigenvalue optimizations ⋮ D.C. programming approach for solving an applied ore-processing problem ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Optimizing a multi-stage production/inventory system by DC programming based approaches ⋮ Analysis sparse representation for nonnegative signals based on determinant measure by DC programming ⋮ Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms ⋮ Convergence analysis of difference-of-convex algorithm with subanalytic data ⋮ Solving DC programs using the cutting angle method ⋮ On the pervasiveness of difference-convexity in optimization and statistics ⋮ On the difference of two maximal monotone operators: Regularization and algorithmic approaches ⋮ A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming ⋮ Signal and image approximation with level-set constraints ⋮ A proximal difference-of-convex algorithm with extrapolation ⋮ DCA based algorithms for feature selection in multi-class support vector machine ⋮ DC programming and DCA: thirty years of developments ⋮ Accelerating the DC algorithm for smooth functions ⋮ Visualizing data as objects by DC (difference of convex) optimization ⋮ DC formulations and algorithms for sparse optimization problems ⋮ On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint ⋮ A study of the difference-of-convex approach for solving linear programs with complementarity constraints ⋮ Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming ⋮ Robust multicategory support vector machines using difference convex algorithm ⋮ A biobjective approach to recoverable robustness based on location planning ⋮ Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations ⋮ Aggregate subgradient method for nonsmooth DC optimization ⋮ Globally solving a nonlinear UAV task assignment problem by stochastic and deterministic optimization approaches ⋮ The hill detouring method for minimizing hinging hyperplanes functions ⋮ Noisy Euclidean distance matrix completion with a single missing node ⋮ Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem ⋮ The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems ⋮ Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations ⋮ A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem ⋮ Extensions on ellipsoid bounds for quadratic integer programming ⋮ Self-organizing maps by difference of convex functions optimization ⋮ Dictionary learning for fast classification based on soft-thresholding ⋮ On the subdifferentiability of the difference of two functions and local minimization ⋮ New and efficient algorithms for transfer prices and inventory holding policies in two-enterprise supply chains ⋮ Error bounds for the difference of two convex multifunctions ⋮ Functional inequalities and theorems of the alternative involving composite functions ⋮ Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA ⋮ DC programming and DCA for globally solving the value-at-risk ⋮ Optimality conditions and duality for DC programming in locally convex spaces ⋮ Double regularization methods for robust feature selection and SVM classification via DC programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• D.C. programming approach for multicommodity network optimization problems with step increasing cost functions
• Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du max
• Convergence of a subgradient method for computing the bound norm of matrices
• Constrained global optimization: algorithms and applications
• Duality in nonconvex optimization
• A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
• Optimization on low rank nonconvex structures
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• On the degree and separability of nonconvexity and applications to optimization problems
• A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
• Solving an inverse problem for an elliptic equation by d.c. programming
• Simplicially-constrained DC optimization over efficient and weakly efficient sets
• Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming
• Towards Tikhonov regularization of non-linear ill-posed problems: a dc programming approach
• Exact penalty in d. c. programming
• 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
• Combination between global and local methods for solving an optimization problem over the efficient set
• Introduction to global optimization
• DC programming: overview.
• D.c sets, d.c. functions and nonlinear equations
• Numerical solution for optimization over the efficient set by d.c. optimization algorithms
• Monotonic Optimization: Problems and Solution Approaches
• A continuous approch for globally solving linearly constrained quadratic
• Monotone Operators and the Proximal Point Algorithm
• Global Optimality Criterion and a Duality with a Zero Gap in Nonconvex Optimization
• A Nonconvex Duality with Zero Gap and Applications
• Global Continuation for Distance Geometry Problems
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
• On the ill-posedness of the trust region subproblem
• Trust Region Methods
• Partial regularization of the sum of two maximal monotone operators
• Proximal Decomposition on the Graph of a Maximal Monotone Operator
• The Effective Energy Transformation Scheme as a Special Continuation Approach to Global Optimization with Application to Molecular Conformation
• Proximité et dualité dans un espace hilbertien
• Convex Analysis
• Convex analysis and global optimization

This page was built for publication: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems