Pages that link to "Item:Q2925836"
From MaRDI portal
The following pages link to Introduction to Nonsmooth Optimization (Q2925836):
Displaying 50 items.
- A difference of convex optimization algorithm for piecewise linear regression (Q2313774) (← links)
- Continuous outer subdifferentials in nonsmooth optimization (Q2328202) (← links)
- Characterization theorem for best polynomial spline approximation with free knots, variable degree and fixed tails (Q2397471) (← links)
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes (Q2399479) (← links)
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems (Q2416961) (← links)
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization (Q2422878) (← links)
- On the structure of regularization paths for piecewise differentiable regularization terms (Q2689863) (← links)
- Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods (Q2693782) (← links)
- Spectral projected subgradient method for nonsmooth convex optimization problems (Q2700023) (← links)
- Computation of maximal turning points to nonlinear equations by nonsmooth optimization (Q2811478) (← links)
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization (Q2817235) (← links)
- An extension of the quasi-Newton method for minimizing locally Lipschitz functions (Q3389584) (← links)
- A trust region method for solving linearly constrained locally Lipschitz optimization problems (Q4559395) (← links)
- Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming (Q4571882) (← links)
- Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour (Q4613990) (← links)
- Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization (Q4620420) (← links)
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization (Q4622889) (← links)
- A sharp augmented Lagrangian-based method in constrained non-convex optimization (Q4631763) (← links)
- Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms (Q4638918) (← links)
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization (Q4639123) (← links)
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization (Q4646678) (← links)
- Weak subgradient method for solving nonsmooth nonconvex optimization problems (Q5009157) (← links)
- (Q5037959) (← links)
- A DC approach for minimax fractional optimization programs with ratios of convex functions (Q5038436) (← links)
- Nonsmooth Constraint Qualifications for Nonconvex Inequality Systems (Q5039375) (← links)
- Using projected cutting planes in the extended cutting plane method (Q5057972) (← links)
- Optimization conditions and decomposable algorithms for convertible nonconvex optimization (Q5058177) (← links)
- Robust piecewise linear <i>L</i><sub>1</sub>-regression via nonsmooth DC optimization (Q5058373) (← links)
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions (Q5058380) (← links)
- Non-convex multiobjective optimization under uncertainty: a descent algorithm. Application to sandwich plate design and reliability (Q5059142) (← links)
- A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities (Q5116553) (← links)
- Application of extreme sub- and epiarguments, convex and concave envelopes to search for global extrema (Q5139113) (← links)
- DC optimization for constructing discrete Sugeno integrals and learning nonadditive measures (Q5151517) (← links)
- Learning Chemical Reaction Networks from Trajectory Data (Q5207548) (← links)
- Minimizing Piecewise-Concave Functions Over Polyhedra (Q5219555) (← links)
- Sparse Inverse Problems over Measures: Equivalence of the Conditional Gradient and Exchange Methods (Q5231667) (← links)
- Characterizing and Testing Subdifferential Regularity in Piecewise Smooth Optimization (Q5231673) (← links)
- A Gradient Sampling Method on Algebraic Varieties and Application to Nonsmooth Low-Rank Optimization (Q5242934) (← links)
- Minimization of marginal functions in mathematical programming based on continuous outer subdifferentials (Q5745159) (← links)
- Outer-approximation algorithms for nonsmooth convex MINLP problems (Q5745165) (← links)
- Finding Saddle-Node Bifurcations via a Nonlinear Generalized Collatz–Wielandt Formula (Q5854856) (← links)
- Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems (Q5860819) (← links)
- Proximal point algorithm for differentiable quasi-convex multiobjective optimization (Q5865307) (← links)
- A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions (Q5883328) (← links)
- Numerical optimization. Theoretical and practical aspects. Transl. from the French (Q5898137) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming (Q5964241) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)
- Characterizations of the solution set for tangentially convex optimization problems (Q6043119) (← links)
- Completely positive factorization by a Riemannian smoothing method (Q6043135) (← links)
