Pages that link to "Item:Q2925836"
From MaRDI portal
The following pages link to Introduction to Nonsmooth Optimization (Q2925836):
Displaying 50 items.
- Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
- Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems (Q727242) (← links)
- An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems (Q824547) (← links)
- A gradient sampling method based on ideal direction for solving nonsmooth optimization problems (Q831368) (← links)
- A scalarization proximal point method for quasiconvex multiobjective minimization (Q905757) (← links)
- Descent gradient methods for nonsmooth minimization problems in ill-posed problems (Q908377) (← links)
- Saddle point criteria in nonsmooth semi-infinite minimax fractional programming problems (Q1621158) (← links)
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints (Q1630269) (← links)
- Saddle representations of positively homogeneous functions by linear functions (Q1634804) (← links)
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization (Q1644014) (← links)
- On solving generalized convex MINLP problems using supporting hyperplane techniques (Q1668811) (← links)
- Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems (Q1679493) (← links)
- Descent algorithm for nonsmooth stochastic multiobjective optimization (Q1687314) (← links)
- Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457) (← links)
- New diagonal bundle method for clustering problems in large data sets (Q1694910) (← links)
- DC programming algorithm for clusterwise linear \(L_1\) regression (Q1706682) (← links)
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators (Q1730476) (← links)
- On gap functions for nonsmooth multiobjective optimization problems (Q1744623) (← links)
- Generalized envelope theorems: applications to dynamic programming (Q1752646) (← links)
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations (Q1754446) (← links)
- A convergence analysis of the method of codifferential descent (Q1756589) (← links)
- An effective adaptive trust region algorithm for nonsmooth minimization (Q1790684) (← links)
- A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming (Q1983659) (← links)
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods (Q1986106) (← links)
- Aggregate subgradient method for nonsmooth DC optimization (Q1996741) (← links)
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions (Q2023656) (← links)
- A nonsmooth optimization approach for hemivariational inequalities with applications to contact mechanics (Q2041009) (← links)
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations (Q2052409) (← links)
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data (Q2066220) (← links)
- On sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints (Q2089243) (← links)
- Alternative regularizations for outer-approximation algorithms for convex MINLP (Q2089881) (← links)
- A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration (Q2095175) (← links)
- Outer approximation for mixed-integer nonlinear robust optimization (Q2095574) (← links)
- An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems (Q2112678) (← links)
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming (Q2129642) (← links)
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems (Q2136887) (← links)
- Generalized derivatives of eigenvalues of a symmetric matrix (Q2151564) (← links)
- A survey of numerical methods for hemivariational inequalities with applications to contact mechanics (Q2160913) (← links)
- Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization (Q2182861) (← links)
- Clusterwise support vector linear regression (Q2189912) (← links)
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm (Q2200088) (← links)
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints (Q2219645) (← 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)
- Optimal control of Sturm-Liouville type evolution differential inclusions with endpoint constraints (Q2244226) (← links)
- An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms (Q2244241) (← links)
- Using regularization and second order information in outer approximation for convex MINLP (Q2297649) (← links)
- Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization (Q2301197) (← links)
- Model-based control of dynamic frictional contact problems using the example of hot rolling (Q2309826) (← links)
