A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Low order-value optimization and applications
- 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
- Towards Tikhonov regularization of non-linear ill-posed problems: a dc programming approach
- Sparse high-dimensional fractional-norm support vector machine via DC programming
- Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach
- Three \(l_1\) based nonconvex methods in constructing sparse mean reverting portfolios
- Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model
- 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
- Global convergence of proximal iteratively reweighted algorithm
- A method for convex minimization based on translated first-order approximations
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- Fast L1-L2 minimization via a proximal operator
- A proximal difference-of-convex algorithm with extrapolation
- DC programming and DCA: thirty years of developments
- Accelerating the DC algorithm for smooth functions
- DC formulations and algorithms for sparse optimization problems
- Minimization of transformed L₁ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering
- A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Linear feature transform and enhancement of classification on deep neural network
- Dictionary learning for fast classification based on soft-thresholding
- Combination between global and local methods for solving an optimization problem over the efficient set
- 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
- A framework for optimization under ambiguity
- Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization
- Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem
- Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems
- Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem
- A branch-and-bound algorithm embedded with DCA for DC programming
- A combined DCA: GA for constructing highly nonlinear balanced Boolean functions in cryptography
- Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing
- Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem
- A proximal DC approach for quadratic assignment problem
- Multiple-source adaptation theory and algorithms
- On the optimal correction of infeasible systems of linear inequalities
- Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression
- A DC programming approach for solving a centralized group key management problem
- Low-rank matrix recovery with Ky Fan 2-\(k\)-norm
- Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation
- The springback penalty for robust signal recovery
- Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring
- Discrepancy-based theory and algorithms for forecasting non-stationary time series
- A modified proximal point method for DC functions on Hadamard manifolds
- Robust regularized extreme learning machine for regression with non-convex loss function via DC program
- A new nonconvex approach for image restoration with Gamma noise
- DCA-based algorithms for DC fitting
- 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
- 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
- Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm
- Stability for trust-region methods via generalized differentiation
- Globally convergent DC trust-region methods
- Boundedness of a type of iterative sequences in two-dimensional quadratic programming
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- Solving \(k\)-center problems involving sets based on optimization techniques
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
- Sequential parametric convex approximation algorithm for bilinear matrix inequality problem
- The modified second APG method for DC optimization problems
- A non-convex algorithm framework based on DC programming and DCA for matrix completion
- Variations and extension of the convex-concave procedure
- Solving partitioning-hub location-routing problem using DCA
- A new efficient algorithm based on DC programming and DCA for clustering
- Application of lower bound direct method to engineering structures
- Binary classification via spherical separator by DC programming and DCA
- Minimizing differences of convex functions with applications to facility location and clustering
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- A sub-additive DC approach to the complementarity problem
- A nonconvex model with minimax concave penalty for image restoration
- An efficient DCA based algorithm for power control in large scale wireless networks
- A DC programming approach for feature selection in support vector machines learning
- A continuous approach for the concave cost supply problem via DC programming and DCA
- Twenty years of linear programming based portfolio optimization
- Discrete tomography by convex--concave regularization and D.C. programming
- Collusive game solutions via optimization
- A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning
- Coderivatives of a Karush-Kuhn-Tucker point set map and applications
- 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
- Solving the index tracking problem: a continuous optimization approach
- The boosted DC algorithm for linearly constrained DC programming
- A continuous approch for globally solving linearly constrained quadratic
- DC approximation approach for \(\ell_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
- Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
- Learning sparse classifiers with difference of convex functions algorithms
- Training robust support vector regression with smooth non-convex loss function
- A proof of convergence of the concave-convex procedure using Zangwill's theory
- Canonical dual approach for minimizing a nonconvex quadratic function over a sphere
- 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
- Solving the trust-region subproblem by a generalized eigenvalue problem
- Convergence analysis of a proximal point algorithm for minimizing differences of functions
This page was built for publication: A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389202)
