Pages that link to "Item:Q4651967"
From MaRDI portal
The following pages link to Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control (Q4651967):
Displaying 50 items.
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
- On the problem of minimizing a difference of polyhedral convex functions under linear constraints (Q346824) (← links)
- Subgradient method for nonconvex nonsmooth optimization (Q353174) (← links)
- Constrained nonconvex nonsmooth optimization via proximal bundle method (Q481058) (← links)
- Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
- GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression (Q515771) (← links)
- Codifferential method for minimizing nonsmooth DC functions (Q539496) (← links)
- DC models for spherical separation (Q604962) (← links)
- Cutting plane oracles to minimize non-smooth non-convex functions (Q618887) (← links)
- A bundle modification strategy for convex minimization (Q869143) (← links)
- A partially inexact bundle method for convex semi-infinite minmax problems (Q907208) (← links)
- Computing proximal points of nonconvex functions (Q959941) (← links)
- New filled functions for nonsmooth global optimization (Q965609) (← links)
- Nonsmooth optimization: Theory and algorithms (Q972622) (← links)
- An inexact proximal point method for solving generalized fractional programs (Q1024832) (← links)
- An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions (Q1665008) (← links)
- A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
- A method for convex minimization based on translated first-order approximations (Q1681778) (← links)
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (Q1704913) (← links)
- A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions (Q1722320) (← links)
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations (Q1754446) (← links)
- Margin maximization in spherical separation (Q1928756) (← links)
- An effective nonsmooth optimization algorithm for locally Lipschitz functions (Q1934631) (← links)
- Generalized order-value optimization (Q1935880) (← links)
- Aggregate subgradient method for nonsmooth DC optimization (Q1996741) (← links)
- A maximum-margin multisphere approach for binary multiple instance learning (Q2077935) (← links)
- A new data-driven robust optimization approach to multi-item newsboy problems (Q2083366) (← links)
- An illumination problem: optimal apex and optimal orientation for a cone of light (Q2250115) (← links)
- Semisupervised spherical separation (Q2285335) (← links)
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions (Q2315256) (← links)
- Support vector machine polyhedral separability in semisupervised learning (Q2342142) (← links)
- Optimal replenishment order placement in a finite time horizon (Q2342144) (← links)
- Aggregate codifferential method for nonsmooth DC optimization (Q2349678) (← links)
- An illumination problem with tradeoff between coverage of a dataset and aperture angle of a conic light beam (Q2358064) (← links)
- Tuning strategy for the proximity parameter in convex minimization (Q2370054) (← links)
- Piecewise linear approximations in nonconvex nonsmooth optimization (Q2391130) (← links)
- Binary classification via spherical separator by DC programming and DCA (Q2393067) (← links)
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes (Q2399479) (← links)
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods (Q2576741) (← links)
- Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods (Q2576742) (← links)
- Global optimization for non-convex programs via convex proximal point method (Q2691402) (← links)
- Comparing different nonsmooth minimization methods and software (Q2885467) (← links)
- A proximal alternating linearization method for nonconvex optimization problems (Q2926053) (← links)
- Data preprocessing in semi-supervised SVM classification (Q2996795) (← links)
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets (Q3192097) (← links)
- Variants to the cutting plane approach for convex nondifferentiable optimization (Q4327932) (← links)
- Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming (Q4571882) (← links)
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization (Q4622889) (← links)
- An SL/QP Algorithm for Minimizing the Spectral Abscissa of Time Delay Systems (Q4637230) (← links)
