In this paper we present a generalization of the classic Firm’s profit maximization problem, using the linear model for the production function, considering a non constant price and maximum constraints for the inputs. We formulate the problem by previously calculating the analytical minimum...

Regularization is used in many different areas of optimization when solutions are sought which not only minimize a given function, but also possess a certain degree of regularity. Popular applications are image denoising, sparse regression and machine learning. Since the choice of the...

In this work, by using weak conjugate maps given in (Azimov and Gasimov, in Int J Appl Math 1:171–192, <CitationRef CitationID="CR1">1999</CitationRef>), weak Fenchel conjugate dual problem, <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${(D_F^w)}$$</EquationSource> </InlineEquation> , and weak Fenchel Lagrange conjugate dual problem <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$${(D_{FL}^w)}$$</EquationSource> </InlineEquation> are constructed. Necessary and sufficient conditions for...</equationsource></inlineequation></equationsource></inlineequation></citationref>

In this paper, we provide some new necessary and sufficient conditions for pseudoconvexity and semistrict quasiconvexity of a given proper extended real-valued function in terms of the Clarke–Rockafellar subdifferential. Further, we extend to programs with pseudoconvex objective function two...

The notions of upper and lower exhausters represent generalizations of the notions of exhaustive families of upper convex and lower concave approximations (u.c.a., l.c.a.). The notions of u.c.a.’s and l.c.a.’s were introduced by Pshenichnyi (Convex Analysis and Extremal Problems, Series in...

In the same spirit as the one of the paper (Hiriart-Urruty and Malick in J. Optim. Theory Appl. 153(3):551–577, <CitationRef CitationID="CR29">2012</CitationRef>) on positive semidefinite matrices, we survey several useful properties of the rank function (of a matrix) and add some new ones. Since the so-called rank minimization problems...</citationref>