Publicação
A study of one class of NLP problems arising in parametric Semi-Infinite Programming
| Resumo: | The paper deals with a nonlinear programming (NLP) problem that depends on a finite number of integers (parameters). This problem has a special form, and arises as an auxiliary problem in study of solutions' properties of parametric semi-infinite programming (SIP) problems with finitely representable compact index sets. Therefore, it is important to provide a deep study of this NLP problem and its properties w.r.t. the values of the parameters. We are especially interested in the case when optimal solutions of the NLP problem satisfy certain properties due to some specific requirements arising in parametric SIP. We establish the values of the parameters for which optimal solutions of the corresponding NLP problem fulfil the needed properties, and suggest an algorithm that determines the right values of the parameters. An example is proposed to illustrate the application of the algorithm. |
|---|---|
| Autores principais: | Kostyukova, O. I. |
| Outros Autores: | Tchemisova, Tatiana; Kurdina, Maryia |
| Assunto: | Nonlinear programming Semi-infinite programming Quadratic programming Parametric problems Optimality conditions |
| Ano: | 2016 |
| País: | Portugal |
| Tipo de documento: | artigo |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Universidade de Aveiro |
| Idioma: | inglês |
| Origem: | RIA - Repositório Institucional da Universidade de Aveiro |
Registos relacionados
article A study of one class of NLP problems arising in parametric Semi-Infinite Programming
por: Kostyukova, Olga
Publicado em: (2016)
por: Kostyukova, Olga
Publicado em: (2016)
groups On properties of one class of Nonlinear Programming problems arising in study of parametric problems of Semi-Infinite Programming
por: Kostyukova, Olga
Publicado em: (2016)
por: Kostyukova, Olga
Publicado em: (2016)
article On Optimal Properties of Special Nonlinear and Semi-infinite Problems Arising in Parametric Optimization
por: Kostyukova, Olga
Publicado em: (2017)
por: Kostyukova, Olga
Publicado em: (2017)
draft Convex Semi-Infinite programming: explicit optimality conditions
por: Kostyukova, O. I.
Publicado em: (2006)
por: Kostyukova, O. I.
Publicado em: (2006)
draft Convex semi-infinite programming: implicit optimality criterion based on the concept of immobile points
por: Kostyukova, O. I.
Publicado em: (2005)
por: Kostyukova, O. I.
Publicado em: (2005)
article Optimality Conditions for Convex Semi-infinite Programming Problems with Finitely Representable
por: Kostyukova, Olga
Publicado em: (2017)
por: Kostyukova, Olga
Publicado em: (2017)
article Sufficient optimality conditions for convex semi-infinite programming
por: Kostyukova, O. I.
Publicado em: (2010)
por: Kostyukova, O. I.
Publicado em: (2010)
article Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices
por: Kostyukova, O. I.
Publicado em: (2010)
por: Kostyukova, O. I.
Publicado em: (2010)
description On a special nonlinear problem arising in the study of convex SIP problems
por: Kostyukova, O. I.
Publicado em: (2006)
por: Kostyukova, O. I.
Publicado em: (2006)
article Existence theorem and optimality conditions for a class of convex
por: Kostyukova, Olga
Publicado em: (2017)
por: Kostyukova, Olga
Publicado em: (2017)
article Optimality Conditions for Convex Semi-infinite Programming Problems with Finitely Representable Compact Index Sets
por: Kostyukova, O.
Publicado em: (2017)
por: Kostyukova, O.
Publicado em: (2017)
article Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem
por: Kostyukova, O. I.
Publicado em: (2015)
por: Kostyukova, O. I.
Publicado em: (2015)
article Optimality conditions for linear copositive programming problems with isolated immobile indices
por: Kostyukova, O. I.
Publicado em: (2018)
por: Kostyukova, O. I.
Publicado em: (2018)
article Immobile indices and CQ-free optimality criteria for linear copositive programming problems
por: Kostyukova, O. I.
Publicado em: (2020)
por: Kostyukova, O. I.
Publicado em: (2020)
article Implicit optimality criterion for convex SIP problem with box constrained index set
por: Kostyukova, O. I.
Publicado em: (2012)
por: Kostyukova, O. I.
Publicado em: (2012)
article Optimality criteria without constraint qualications for linear semidenite problems
por: Kostyukova, O. I.
Publicado em: (2012)
por: Kostyukova, O. I.
Publicado em: (2012)
book Testing Regularity on Linear Semidefinite Problems
por: Macedo, Eloísa
Publicado em: (2015)
por: Macedo, Eloísa
Publicado em: (2015)
groups On numerical testing of the regularity of semidefinite problems
por: Macedo, Eloísa
Publicado em: (2013)
por: Macedo, Eloísa
Publicado em: (2013)
article Global optimization of bilinear programs with a multiparametric disaggregation technique
por: Kolodziej, Scott
Publicado em: (2013)
por: Kolodziej, Scott
Publicado em: (2013)
article On the algorithm of determination of immobile indices for convex SIP problems
por: Kostyukova, Olga I.
Publicado em: (2008)
por: Kostyukova, Olga I.
Publicado em: (2008)
article On strong duality in linear copositive programming
por: Kostyukova, O. I.
Publicado em: (2021)
por: Kostyukova, O. I.
Publicado em: (2021)
description On strong duality in linear copositive programming
por: Kostyukova, O. I.
Publicado em: (2020)
por: Kostyukova, O. I.
Publicado em: (2020)
article On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets
por: Tchemisova, T. V.
Publicado em: (2014)
por: Tchemisova, T. V.
Publicado em: (2014)
article Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets
por: Kostyukova, O. I.
Publicado em: (2020)
por: Kostyukova, O. I.
Publicado em: (2020)
draft A constructive algorithm for determination of immobile indices in convex SIP problems with polyhedral index sets
por: Kostyukova, O. I.
Publicado em: (2012)
por: Kostyukova, O. I.
Publicado em: (2012)
article A new Branch and Bound method for a discrete truss topology design problem
por: Cerveira, Adelaide
Publicado em: (2013)
por: Cerveira, Adelaide
Publicado em: (2013)
draft Rigidity of abnormal extrema in the problem of non-linear programming with mixed constraints
por: Sarychev, A. V.
Publicado em: (2004)
por: Sarychev, A. V.
Publicado em: (2004)
article Rigidity of abnormal extrema in nonlinear programming problems with equality and inequality constraints
por: Tchemisova, T. V.
Publicado em: (2007)
por: Tchemisova, T. V.
Publicado em: (2007)
article Univariate parameterization for global optimization of mixed-integer polynomial problems
por: Teles, João P.
Publicado em: (2013)
por: Teles, João P.
Publicado em: (2013)
article A heuristic for the stability number of a graph based on convex quadratic programming and tabu search
por: Cavique, Luís
Publicado em: (2009)
por: Cavique, Luís
Publicado em: (2009)
draft Cross-country efficiency of secondary education provision : a semi-parametric analysis with nondiscretionary inputs
por: Afonso, António
Publicado em: (2005)
por: Afonso, António
Publicado em: (2005)
book Solving mathematical programs with complementarity constraints with nonlinear solvers
por: Rodrigues, Helena Sofia
Publicado em: (2006)
por: Rodrigues, Helena Sofia
Publicado em: (2006)
article Comparison of global optimization algorithms for the design of water-using networks
por: Castro, Pedro
Publicado em: (2013)
por: Castro, Pedro
Publicado em: (2013)
description A velocity tracking approach for the Data Assimilation problem in blood flow simulations
por: Tiago, Jorge
Publicado em: (2017)
por: Tiago, Jorge
Publicado em: (2017)
article A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph
por: Luz, C. J.
Publicado em: (1998)
por: Luz, C. J.
Publicado em: (1998)
article A characterization of the weighted Lovász number based on convex quadratic programming
por: Luz, Carlos J.
Publicado em: (2016)
por: Luz, Carlos J.
Publicado em: (2016)
article ne-Course for Learning Programming
por: Figueiredo, José
Publicado em: (2018)
por: Figueiredo, José
Publicado em: (2018)
article Study of a special nonlinear problem arising in convex semi-infinite programming
por: Kostyukova, O.
Publicado em: (2009)
por: Kostyukova, O.
Publicado em: (2009)
article Exploring constraint qualification-free optimality conditions for linear second-order cone programming
por: Kostyukova, Olga
Publicado em: (2024)
por: Kostyukova, Olga
Publicado em: (2024)
article A mathematical formulation for a secondary school timetabling problem
por: Pato, Margarida Vaz
Publicado em: (1998)
por: Pato, Margarida Vaz
Publicado em: (1998)
Registos relacionados
-
article A study of one class of NLP problems arising in parametric Semi-Infinite Programming
por: Kostyukova, Olga
Publicado em: (2016) -
groups On properties of one class of Nonlinear Programming problems arising in study of parametric problems of Semi-Infinite Programming
por: Kostyukova, Olga
Publicado em: (2016) -
article On Optimal Properties of Special Nonlinear and Semi-infinite Problems Arising in Parametric Optimization
por: Kostyukova, Olga
Publicado em: (2017) -
draft Convex Semi-Infinite programming: explicit optimality conditions
por: Kostyukova, O. I.
Publicado em: (2006) -
draft Convex semi-infinite programming: implicit optimality criterion based on the concept of immobile points
por: Kostyukova, O. I.
Publicado em: (2005)