Introduction to nonsmooth optimization. Theory, practice and software
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Saddle point criteria in nonsmooth semi-infinite minimax fractional programming problems
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
- Saddle representations of positively homogeneous functions by linear functions
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
- On solving generalized convex MINLP problems using supporting hyperplane techniques
- Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems
- Descent algorithm for nonsmooth stochastic multiobjective optimization
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- New diagonal bundle method for clustering problems in large data sets
- DC programming algorithm for clusterwise linear \(L_1\) regression
- Nonsmooth optimization and its applications. Based on the workshop ``Nonsmooth Optimization and its Applications, Bonn, Germany, May 15--19, 2017
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
- On gap functions for nonsmooth multiobjective optimization problems
- Generalized envelope theorems: applications to dynamic programming
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- A convergence analysis of the method of codifferential descent
- An effective adaptive trust region algorithm for nonsmooth minimization
- A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
- Aggregate subgradient method for nonsmooth DC optimization
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
- A nonsmooth optimization approach for hemivariational inequalities with applications to contact mechanics
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data
- On sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints
- Alternative regularizations for outer-approximation algorithms for convex MINLP
- 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
- Outer approximation for mixed-integer nonlinear robust optimization
- An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems
- Generalized derivatives of eigenvalues of a symmetric matrix
- A survey of numerical methods for hemivariational inequalities with applications to contact mechanics
- Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization
- Clusterwise support vector linear regression
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
- Incremental DC optimization algorithm for large-scale clusterwise linear regression
- Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions
- An augmented subgradient method for minimizing nonsmooth DC functions
- Optimal control of Sturm-Liouville type evolution differential inclusions with endpoint constraints
- An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms
- Using regularization and second order information in outer approximation for convex MINLP
- Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization
- Model-based control of dynamic frictional contact problems using the example of hot rolling
- A difference of convex optimization algorithm for piecewise linear regression
- Continuous outer subdifferentials in nonsmooth optimization
- Characterization theorem for best polynomial spline approximation with free knots, variable degree and fixed tails
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
- On the structure of regularization paths for piecewise differentiable regularization terms
- Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods
- Spectral projected subgradient method for nonsmooth convex optimization problems
- Computation of maximal turning points to nonlinear equations by nonsmooth optimization
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
- An extension of the quasi-Newton method for minimizing locally Lipschitz functions
- A trust region method for solving linearly constrained locally Lipschitz optimization problems
- Double bundle method for finding Clarke stationary points in nonsmooth DC programming
- Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour
- Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
- A sharp augmented Lagrangian-based method in constrained non-convex optimization
- Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
- scientific article; zbMATH DE number 2133301 (Why is no real title available?)
- Diagonal bundle method for nonsmooth sparse optimization
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
- Modern nonconvex nondifferentiable optimization
- A two-phase bundle method with bundle modification for nonsmooth constrained optimization
- A DC approach for minimax fractional optimization programs with ratios of convex functions
- Nonsmooth constraint qualifications for nonconvex inequality systems
- Using projected cutting planes in the extended cutting plane method
- Optimization conditions and decomposable algorithms for convertible nonconvex optimization
- Robust piecewise linear L1-regression via nonsmooth DC optimization
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- Non-convex multiobjective optimization under uncertainty: a descent algorithm. Application to sandwich plate design and reliability
- A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
- Application of extreme sub- and epiarguments, convex and concave envelopes to search for global extrema
- DC optimization for constructing discrete Sugeno integrals and learning nonadditive measures
- Learning chemical reaction networks from trajectory data
- Minimizing Piecewise-Concave Functions Over Polyhedra
- Sparse inverse problems over measures: equivalence of the conditional gradient and exchange methods
- Characterizing and testing subdifferential regularity in piecewise smooth optimization
- A gradient sampling method on algebraic varieties and application to nonsmooth low-rank optimization
- Minimization of marginal functions in mathematical programming based on continuous outer subdifferentials
- Outer-approximation algorithms for nonsmooth convex MINLP problems
- Finding saddle-node bifurcations via a nonlinear generalized Collatz-Wielandt formula
- Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
- Proximal point algorithm for differentiable quasi-convex multiobjective optimization
- A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Essentials of numerical nonsmooth optimization
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- Essentials of numerical nonsmooth optimization
- Characterizations of the solution set for tangentially convex optimization problems
- Completely positive factorization by a Riemannian smoothing method
- Optimality conditions in DC-constrained mathematical programming problems
- A gradient sampling algorithm for stratified maps with applications to topological data analysis
This page was built for publication: Introduction to nonsmooth optimization. Theory, practice and software
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2925836)
