Pages that link to "Item:Q5906869"

The following pages link to Convex analysis and global optimization (Q5906869):

Displaying 50 items.

• Piecewise-linear approximations of multidimensional functions (Q970578) (← links)
• A general global optimization approach for solving location problems in the plane (Q995943) (← links)
• Two-dimensional Banach spaces with polynomial numerical index zero (Q1014509) (← links)
• Optimality conditions in global optimization and their applications (Q1016343) (← links)
• Concave programming and DH-point (Q1029682) (← links)
• DC programming and DCA for globally solving the value-at-risk (Q1035285) (← links)
• Numerical solution for bounding feasible point sets (Q1398432) (← links)
• On global optimality conditions and cutting plane algorithms (Q1407243) (← links)
• Recent developments and trends in global optimization (Q1593827) (← links)
• A heuristic approach to solving a class of bilinear matrix inequality problems (Q1614849) (← links)
• Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver (Q1679488) (← links)
• Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function (Q1699146) (← links)
• DC programming algorithm for clusterwise linear \(L_1\) regression (Q1706682) (← links)
• On the pervasiveness of difference-convexity in optimization and statistics (Q1739035) (← links)
• Visualizing data as objects by DC (difference of convex) optimization (Q1749447) (← links)
• Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations (Q1754446) (← links)
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961) (← links)
• Design of ODMA digital waveforms using non-convex optimization methods (Q1772985) (← links)
• A branch and bound algorithm for solving a class of D-C programming (Q1780534) (← links)
• Difference of convex solution of quadratically constrained optimization problems. (Q1810525) (← links)
• A storm of feasibility pumps for nonconvex MINLP (Q1925794) (← links)
• Beyond canonical dc-optimization: the single reverse polar problem (Q1935286) (← links)
• A practical but rigorous approach to sum-of-ratios optimization in geometric applications (Q1938908) (← links)
• A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming (Q1983659) (← links)
• Aggregate subgradient method for nonsmooth DC optimization (Q1996741) (← links)
• Locating a semi-obnoxious facility in the special case of Manhattan distances (Q2009180) (← links)
• A convergent conical algorithm with \(\omega \)-bisection for concave minimization (Q2018479) (← links)
• Convexification techniques for linear complementarity constraints (Q2045009) (← links)
• New explicit extragradient methods for solving a class of bilevel equilibrium problems (Q2049013) (← links)
• DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
• Piecewise linear bounding functions in univariate global optimization (Q2156897) (← links)
• Clusterwise support vector linear regression (Q2189912) (← links)
• Solving polyhedral d.c. optimization problems via concave minimization (Q2200081) (← links)
• Starshaped sets (Q2216442) (← links)
• Incremental DC optimization algorithm for large-scale clusterwise linear regression (Q2226259) (← links)
• Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions (Q2230768) (← links)
• An augmented subgradient method for minimizing nonsmooth DC functions (Q2231043) (← links)
• A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables (Q2255939) (← links)
• Outer approximation algorithms for canonical DC problems (Q2269586) (← links)
• Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function (Q2271151) (← links)
• Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets (Q2282820) (← links)
• A local search method for optimization problem with d.c. inequality constraints (Q2295325) (← links)
• New global optimality conditions for nonsmooth DC optimization problems (Q2301178) (← links)
• Complexity results on planar multifacility location problems with forbidden regions (Q2311127) (← links)
• A difference of convex optimization algorithm for piecewise linear regression (Q2313774) (← links)
• A note on the paper ``Optimality conditions for vector optimization problems with difference of convex maps'' (Q2317857) (← links)
• Global optimization for the sum of concave-convex ratios problem (Q2336807) (← links)
• Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming (Q2338781) (← links)
• Optimal replenishment order placement in a finite time horizon (Q2342144) (← links)
• (\(\epsilon\)-)efficiency in difference vector optimization (Q2342955) (← links)