Numerical Nonsmooth Optimization 2020
DOI: 10.1007/978-3-030-34910-3_16
|View full text |Cite
|
Sign up to set email alerts
|

On Mixed Integer Nonsmooth Optimization

Abstract: In this chapter we review some deterministic solution methods for convex mixed integer nonsmooth optimization problems. The methods are branch and bound, outer approximation, extended cutting plane, extended supporting hyperplane and extended level bundle method. Nonsmoothness is taken into account by using Clarke subgradients as a substitute for the classical gradient. Ideas for convergence proofs are given as well as references where the details can be found. We also consider how some algorithms can be modif… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 49 publications
(106 reference statements)
0
1
0
Order By: Relevance
“…These problems may be simple bound problems, problems with more specific constraints, or even problems with different types of variables. For instance, problems can be nonlinear, nonconvex, with equality (or inequality) constraints and with integer, continuous, or mixed integer variables [1,2,6].…”
Section: An Improved Multi-threaded Implementation Of the Mcsfilter O...mentioning
confidence: 99%
“…These problems may be simple bound problems, problems with more specific constraints, or even problems with different types of variables. For instance, problems can be nonlinear, nonconvex, with equality (or inequality) constraints and with integer, continuous, or mixed integer variables [1,2,6].…”
Section: An Improved Multi-threaded Implementation Of the Mcsfilter O...mentioning
confidence: 99%