1 citations · 1 across the 17 of their papers we have counts for
23 papers
Mangasarian-Fromovitz-type constraint qualification and optimality conditions for smooth infinite programming problems
Ewa M. Bednarczuk, Krzysztof W. Leśniewski, Krzysztof E. Rutkowski
We introduce a constraint qualification condition (GPMFCQ) for smooth infinite programming problems, where the nonlinear operator defining the equality constraints has nonsurjectiv…
Approximate solutions to the multiple-choice knapsack problem by multiobjectivization and Chebyshev scalarization
E. M. Bednarczuk, I. Kaliszewski, J. Miroforidis
The method BISSA, proposed by Bednarczuk, Miroforidis, and Pyzel, provides approximate solutions to the multiple-choice knapsack problem. To fathom the optimality gap that is left…
On global solvability of a class of possibly nonconvex QCQP problems in Hilbert spaces
Ewa M. Bednarczuk, Giovanni Bruccola
We provide conditions ensuring that the KKT-type conditions characterizes the global optimality for quadratically constrained (possibly nonconvex) quadratic programming QCQP proble…
Calculus rules for proximal ε-subdifferentials and inexact proximity operators for weakly convex functions
Ewa Bednarczuk, Giovanni Bruccola, Gabriele Scrivanti +1
We investigate inexact proximity operators for weakly convex functions. To this aim, we derive sum rules for proximal ε-subdifferentials, by incorporating the moduli of weak convex…
Duality for Composite Optimization Problem within the Framework of Abstract Convexity
The Hung Tran, Ewa Bednarczuk
We study conjugate and Lagrange dualities for composite optimization problems within the framework of abstract convexity. We provide conditions for zero duality gap in conjugate du…
Finding global solutions for a class of possibly nonconvex QCQP problems through the S-lemma
Ewa M. Bednarczuk, Giovanni Bruccola
In this paper we provide necessary and sufficient (KKT) conditions for global optimality for a new class of possibly nonconvex quadratically constrained quadratic programming (QCQP…