Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets
The concepts of immobile indices and their immobility orders are objective and important characteristics of feasible sets of semi-infinite programming (SIP) problems. They can be used for the formulation of new efficient optimality conditions without constraint qualifications. Given a class of conve...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2019
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10773/25231 |
| País: | Portugal |
| Oai: | oai:ria.ua.pt:10773/25231 |