On local search in d.c. optimization problems
From MaRDI portal
Recommendations
- On a global search in D.C. optimization problems
- Global and local search methods for D.C. constrained problems
- A local search method for optimization problem with d.c. inequality constraints
- Computational Study of Local Search Methods for a D.C. Optimization Problem with Inequality Constraints
- On d.c. optimization problems
- scientific article; zbMATH DE number 5159135
- scientific article; zbMATH DE number 1016966
- Local search in problems with nonconvex constraints
- Local search: complexity and approximation
Cites work
- Convex analysis and global optimization
- Global optimality conditions for nonconvex optimization
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Handbook of global optimization
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3950216 (Why is no real title available?)
- scientific article; zbMATH DE number 3658896 (Why is no real title available?)
- scientific article; zbMATH DE number 2068038 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 2210595 (Why is no real title available?)
- Iterative Solution of Nonlinear Optimal Control Problems
- Local search in problems with nonconvex constraints
- On a decomposition method for nonconvex global optimization
- On computational search for optimistic solutions in bilevel problems
- On duality bound methods for nonconvex global optimization
- On solving nonconvex optimization problems by reducing the duality gap
- On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions
- On the convergence of Newton iterations to non-stationary points
- Sign reversion approach to concave minimization problems
- The BFGS method with exact line searches fails for non-convex objective functions
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization
- The use of grossone in mathematical programming and operations research
- The Validity of a Family of Optimization Methods
Cited in
(34)- DC programming algorithm for clusterwise linear \(L_1\) regression
- D.C. programming approach for solving an applied ore-processing problem
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
- A local search scheme for the inequality-constrained optimal control problem
- On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game
- K-means clustering via a nonconvex optimization approach
- Clusterwise support vector linear regression
- An inertial algorithm for DC programming
- A local search method for optimization problem with d.c. inequality constraints
- New global optimality conditions for nonsmooth DC optimization problems
- Convex maximization formulation of general sphere packing problem
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- Variations and extension of the convex-concave procedure
- Global optimality conditions in nonconvex optimization
- Global optimality conditions and exact penalization
- On solving the sum-of-ratios problem
- Local search in quadratic two-person game
- On the solution of convex bilevel optimization problems
- An approach to fractional programming via d.c. constraints problem: local search
- On numerical solving the spherical separability problem
- Fractional programming approach to a cost minimization problem in electricity market
- scientific article; zbMATH DE number 1488016 (Why is no real title available?)
- scientific article; zbMATH DE number 1569002 (Why is no real title available?)
- scientific article; zbMATH DE number 2206827 (Why is no real title available?)
- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
- A general purpose exact solution method for mixed integer concave minimization problems
- Semi-supervised \(k\)-means clustering via DC programming approach
- Minimizing sequences in a constrained DC optimization problem
- A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering
- Computational Study of Local Search Methods for a D.C. Optimization Problem with Inequality Constraints
- On Search for All Roots of a System of Quadratic Equations
- On active-set methods for quadratic problems with positive semidefinite matrices
- D. C. optimization approach for finding Berge equilibrium in bimatrix game
- Mahalanobis-distance-based clustering via DC optimization approach
This page was built for publication: On local search in d.c. optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299416)
