Introduction to Nonsmooth Optimization
From MaRDI portal
Publication:2925836
DOI10.1007/978-3-319-08114-4zbMath1312.90053OpenAlexW2485305008WikidataQ109595683 ScholiaQ109595683MaRDI QIDQ2925836
Napsu Karmitsa, Marko M. Mäkelä, Adil M. Bagirov
Publication date: 28 October 2014
Full work available at URL: https://doi.org/10.1007/978-3-319-08114-4
optimality conditionsconvex analysisnonsmooth problemsnonconvex analysisnonsmooth optimization methodsgeneralized convexitiesNSO softwares
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions ⋮ An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems ⋮ A DC approach for minimax fractional optimization programs with ratios of convex functions ⋮ Nonsmooth Constraint Qualifications for Nonconvex Inequality Systems ⋮ Saddle point criteria in nonsmooth semi-infinite minimax fractional programming problems ⋮ A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming ⋮ A gradient sampling method based on ideal direction for solving nonsmooth optimization problems ⋮ Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints ⋮ Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems ⋮ Saddle representations of positively homogeneous functions by linear functions ⋮ 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 ⋮ Computational efficiency of the simplex embedding method in convex nondifferentiable optimization ⋮ Generalized derivatives of eigenvalues of a symmetric matrix ⋮ A trust region method for solving linearly constrained locally Lipschitz optimization problems ⋮ A survey of numerical methods for hemivariational inequalities with applications to contact mechanics ⋮ 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 ⋮ On solving generalized convex MINLP problems using supporting hyperplane techniques ⋮ An extension of the quasi-Newton method for minimizing locally Lipschitz functions ⋮ Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems ⋮ Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization ⋮ Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems ⋮ Characterizations of the solution set for tangentially convex optimization problems ⋮ Completely positive factorization by a Riemannian smoothing method ⋮ Descent algorithm for nonsmooth stochastic multiobjective optimization ⋮ Clusterwise support vector linear regression ⋮ Optimal subgradient algorithms for large-scale convex optimization in simple domains ⋮ Numerical infinitesimals in a variable metric method for convex nonsmooth optimization ⋮ New diagonal bundle method for clustering problems in large data sets ⋮ On the structure of regularization paths for piecewise differentiable regularization terms ⋮ On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm ⋮ A scalarization proximal point method for quasiconvex multiobjective minimization ⋮ A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities ⋮ Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods ⋮ Descent gradient methods for nonsmooth minimization problems in ill-posed problems ⋮ DC programming algorithm for clusterwise linear \(L_1\) regression ⋮ Spectral projected subgradient method for nonsmooth convex optimization problems ⋮ 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 ⋮ An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints ⋮ Application of extreme sub- and epiarguments, convex and concave envelopes to search for global extrema ⋮ Incremental DC optimization algorithm for large-scale clusterwise linear regression ⋮ Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators ⋮ A sharp augmented Lagrangian-based method in constrained non-convex optimization ⋮ Unnamed Item ⋮ 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 ⋮ Diagonal bundle method for nonsmooth sparse optimization ⋮ Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms ⋮ Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization ⋮ DC optimization for constructing discrete Sugeno integrals and learning nonadditive measures ⋮ A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming ⋮ On gap functions for nonsmooth multiobjective optimization problems ⋮ A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods ⋮ A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization ⋮ 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 ⋮ Generalized envelope theorems: applications to dynamic programming ⋮ Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations ⋮ Aggregate subgradient method for nonsmooth DC optimization ⋮ A convergence analysis of the method of codifferential descent ⋮ Minimization of marginal functions in mathematical programming based on continuous outer subdifferentials ⋮ Outer-approximation algorithms for nonsmooth convex MINLP problems ⋮ A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions ⋮ Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems ⋮ An effective adaptive trust region algorithm for nonsmooth minimization ⋮ Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming ⋮ The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming ⋮ Learning Chemical Reaction Networks from Trajectory Data ⋮ A nonsmooth optimization approach for hemivariational inequalities with applications to contact mechanics ⋮ Essentials of numerical nonsmooth optimization ⋮ Using regularization and second order information in outer approximation for convex MINLP ⋮ Computation of maximal turning points to nonlinear equations by nonsmooth optimization ⋮ Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization ⋮ Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations ⋮ Minimizing Piecewise-Concave Functions Over Polyhedra ⋮ Diagonal discrete gradient bundle method for derivative free nonsmooth 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 ⋮ A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data ⋮ 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 ⋮ Continuous outer subdifferentials in nonsmooth optimization ⋮ On sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints ⋮ Alternative regularizations for outer-approximation algorithms for convex MINLP ⋮ Finding Saddle-Node Bifurcations via a Nonlinear Generalized Collatz–Wielandt Formula ⋮ Weak subgradient method for solving nonsmooth nonconvex optimization problems ⋮ 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 ⋮ Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems ⋮ Essentials of numerical nonsmooth optimization ⋮ Proximal point algorithm for differentiable quasi-convex multiobjective optimization ⋮ An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems ⋮ Optimality conditions in DC-constrained mathematical programming problems ⋮ A gradient sampling algorithm for stratified maps with applications to topological data analysis ⋮ Shape optimization for the Stokes hemivariational inequality with slip boundary condition ⋮ A hierarchy of spectral relaxations for polynomial optimization ⋮ On the convergence of gradient projection methods for non-convex optimal control problems with affine system ⋮ On optimality conditions and duality for multiobjective optimization with equilibrium constraints ⋮ Sufficient optimality conditions for the optimal control problem ⋮ A version of bundle trust region method with linear programming ⋮ New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information ⋮ Analyzing the Influence of Agents in Trust Networks: Applying Nonsmooth Eigensensitivity Theory to a Graph Centrality Problem ⋮ Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut ⋮ Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints ⋮ Tensor completion via multi-directional partial tensor nuclear norm with total variation regularization ⋮ \(E\)-subdifferential of \(E\)-convex functions and its applications to minimization problem ⋮ A nonsmooth optimization approach for time-dependent hemivariational inequalities ⋮ Minimizing oracle-structured composite functions ⋮ Derivative-free optimization of a rapid-cycling synchrotron ⋮ Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy ⋮ Best approximation with geometric constraints ⋮ Estimating the delay margin for stability of linear delay systems by the weighted matrix measure ⋮ A new nonmonotone line search method for nonsmooth nonconvex optimization
Uses Software
This page was built for publication: Introduction to Nonsmooth Optimization
