Pseudo-Concave Programming and Lagrange Regularity
From MaRDI portal
Cited in
(25)- On indefinite programming problems
- On indefinite programming problems
- Stability theorems for infinitely constrained mathematical programs
- Optimality conditions for non-lipschitz generalized convex programming via clarke-rockafellar gradients
- Stationary Points and Necessary Conditions in Vector Extremum Problems
- Invariant pseudolinearity with applications
- C-programming and the minimization of pseudolinear and additive concave functions
- A note on characterization of solution sets to pseudolinear programming problems
- Generalized pseudolinearity
- A new look at fractional programming
- On pseudolinear functions
- Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
- Convergence bounds for nonlinear programming algorithms
- Some results on pseudolinear quadratic fractional functions
- On the pseudolinearity of quadratic fractional functions
- Generalized affine functions and generalized differentials
- Rates of convergence for a method of centers algorithm
- Pseudolinearity and efficiency
- First and second order characterizations of pseudolinear functions
- Über einige Anwendungen der semiinfiniten Optimierung
- Condizioni necessarie e sufficienti per un problema di programmazione non lineare
- Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems
- The convexity of the solution set of a pseudoconvex inequality
- Invex programming problems with equality and inequality constraints
- On characterizing the solution sets of pseudolinear programs
This page was built for publication: Pseudo-Concave Programming and Lagrange Regularity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5529078)
