scientific article

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

nonconvex optimization optimal solutions convergence properties subgradients duality schemes

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Duality theory (optimization) (49N15)

Related Items

Variations and extension of the convex-concave procedure ⋮ A DC approach for minimax fractional optimization programs with ratios of convex functions ⋮ Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions ⋮ Synthesizing invariant barrier certificates via difference-of-convex programming ⋮ Unnamed Item ⋮ A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning ⋮ On two recent nonconvex penalties for regularization in machine learning ⋮ Confidence Bands for a Log-Concave Density ⋮ DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ Global convergence of a proximal linearized algorithm for difference of convex functions ⋮ Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres ⋮ A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem ⋮ Testing copositivity with the help of difference-of-convex optimization ⋮ Some brief observations in minimizing the sum of locally Lipschitzian functions ⋮ A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions ⋮ Fenchel conjugate via Busemann function on Hadamard manifolds ⋮ Minimax D-optimal designs for multivariate regression models with multi-factors ⋮ Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm ⋮ Finding robust minimizer for non-convex phase retrieval ⋮ A modified proximal point method for DC functions on Hadamard manifolds ⋮ An efficient DCA based algorithm for power control in large scale wireless networks ⋮ Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints ⋮ Unified SVM algorithm based on LS-DC loss ⋮ First order inertial optimization algorithms with threshold effects associated with dry friction ⋮ A bundle-type method for nonsmooth DC programs ⋮ A refined inertial DC algorithm for DC programming ⋮ A three-operator splitting algorithm with deviations for generalized DC programming ⋮ A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program ⋮ Open issues and recent advances in DC programming and DCA ⋮ An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost ⋮ Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies ⋮ Nonconvex optimization for robust tensor completion from grossly sparse observations ⋮ DCA-based algorithms for DC fitting ⋮ Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions ⋮ An augmented subgradient method for minimizing nonsmooth DC functions ⋮ DC programming and DCA: thirty years of developments ⋮ Accelerating the DC algorithm for smooth functions ⋮ Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming ⋮ Quadratic Majorization for Nonconvex Loss with Applications to the Boosting Algorithm ⋮ The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems ⋮ An inertial algorithm for DC programming ⋮ On a Solving Bilevel D.C.-Convex Optimization Problems ⋮ Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression ⋮ The modified second APG method for DC optimization problems ⋮ An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels ⋮ Towards Tikhonov regularization of non-linear ill-posed problems: a dc programming approach ⋮ Analysis of generalized Bregman surrogate algorithms for nonsmooth nonconvex statistical learning ⋮ Numerical solution for optimization over the efficient set by d.c. optimization algorithms ⋮ Double regularization methods for robust feature selection and SVM classification via DC programming ⋮ Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise ⋮ Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming ⋮ A unified Douglas-Rachford algorithm for generalized DC programming ⋮ On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game