A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
From MaRDI portal
Publication:4389202
DOI10.1137/S1052623494274313zbMath0913.65054OpenAlexW2051664786MaRDI QIDQ4389202
Publication date: 12 May 1998
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623494274313
DCAnumerical experimentsLanczos methodtrust-region subproblemregularization techniquesd.c. optimizationd.c. dualityglobal and local optimality conditionsGoldstein-Levitin-Polyak gradient projection algorithm
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items (only showing first 100 items - show all)
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 ⋮ Low-rank matrix recovery with Ky Fan 2-\(k\)-norm ⋮ MM algorithms for distance covariance based sufficient dimension reduction and sufficient variable selection ⋮ Coderivatives of implicit multifunctions and stability of variational systems ⋮ DC programming techniques for solving a class of nonlinear bilevel programs ⋮ DCA based algorithms for multiple sequence alignment (MSA) ⋮ Three \(l_1\) based nonconvex methods in constructing sparse mean reverting portfolios ⋮ DC approximation approaches for sparse optimization ⋮ Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model ⋮ DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ 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 ⋮ Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation ⋮ The springback penalty for robust signal recovery ⋮ Variational inequalities over Euclidean balls ⋮ An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs ⋮ DC models for spherical separation ⋮ Global convergence of proximal iteratively reweighted algorithm ⋮ Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA ⋮ Margin maximization in spherical separation ⋮ A method for convex minimization based on translated first-order approximations ⋮ Value-at-risk optimization using the difference of convex algorithm ⋮ Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring ⋮ A framework for optimization under ambiguity ⋮ Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms ⋮ Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm ⋮ Discrepancy-based theory and algorithms for forecasting non-stationary time series ⋮ 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 ⋮ A modified proximal point method for DC functions on Hadamard manifolds ⋮ An efficient DC programming approach for portfolio decision with higher moments ⋮ On solving linear complementarity problems by DC programming and DCA ⋮ Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems ⋮ New and efficient DCA based algorithms for minimum sum-of-squares clustering ⋮ Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem ⋮ Properties of two DC algorithms in quadratic programming ⋮ Multi-instance multi-label learning ⋮ Robust regularized extreme learning machine for regression with non-convex loss function via DC program ⋮ Exact penalty and error bounds in DC programming ⋮ A DC programming approach for solving the symmetric eigenvalue complementarity problem ⋮ Optimal marriage Fitting for imperfect statistics ⋮ A partially inexact bundle method for convex semi-infinite minmax problems ⋮ A new nonconvex approach for image restoration with Gamma noise ⋮ A branch-and-bound algorithm embedded with DCA for DC programming ⋮ A combined DCA: GA for constructing highly nonlinear balanced Boolean functions in cryptography ⋮ Behavior of DCA sequences for solving the trust-region subproblem ⋮ The space decomposition theory for a class of eigenvalue optimizations ⋮ Optimizing a multi-stage production/inventory system by DC programming based approaches ⋮ Linear convergence of a type of iterative sequences in nonconvex quadratic programming ⋮ Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms ⋮ DCA-based algorithms for DC fitting ⋮ Convergence analysis of difference-of-convex algorithm with subanalytic data ⋮ 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 ⋮ Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing ⋮ Fast L1-L2 minimization via a proximal operator ⋮ Signal and image approximation with level-set constraints ⋮ A proximal difference-of-convex algorithm with extrapolation ⋮ 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 ⋮ The challenge in managing new financial risks: adopting an heuristic or theoretical approach ⋮ On image reconstruction algorithms for binary electromagnetic geotomography ⋮ 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 ⋮ DC formulations and algorithms for sparse optimization problems ⋮ Minimization of transformed \(L_1\) 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 ⋮ Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm ⋮ A DC optimization-based clustering technique for edge detection ⋮ Stability for trust-region methods via generalized differentiation ⋮ Globally convergent DC trust-region methods ⋮ A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique ⋮ Boundedness of a type of iterative sequences in two-dimensional quadratic programming ⋮ 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 ⋮ Linear feature transform and enhancement of classification on deep neural network ⋮ A proximal DC approach for quadratic assignment problem ⋮ Multiple-source adaptation theory and algorithms ⋮ Self-organizing maps by difference of convex functions optimization ⋮ Dictionary learning for fast classification based on soft-thresholding ⋮ Static response analysis of structures with interval parameters using the second-order Taylor series expansion and the DCA for QB ⋮ New and efficient algorithms for transfer prices and inventory holding policies in two-enterprise supply chains ⋮ On the optimal correction of infeasible systems of linear inequalities ⋮ 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 ⋮ Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression ⋮ Low order-value optimization and applications ⋮ Towards Tikhonov regularization of non-linear ill-posed problems: a dc programming approach ⋮ 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 ⋮ Tilt stability for quadratic programs with one or two quadratic inequality constraints ⋮ Double regularization methods for robust feature selection and SVM classification via DC programming ⋮ A DC programming approach for solving a centralized group key management problem ⋮ Combination between global and local methods for solving an optimization problem over the efficient set
This page was built for publication: A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
