Further study on strong Lagrangian duality property for invex programs via penalty functions.
Zhang, J., Huang, X.X. (2010)
Journal of Inequalities and Applications [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Bilevel programs with extremal value function: global optimality.”
Further study on strong Lagrangian duality property for invex programs via penalty functions.
Decrease of property in vector optimization
Dušan Bednařík, Karel Pastor (2009)
RAIRO - Operations Research
Similarity:
In the paper we generalize sufficient and necessary optimality conditions obtained by Ginchev, Guerraggio, Rocca, and by authors with the help of the notion of ℓ-stability for vector functions.
Reverse convex problems: an approach based on optimality conditions.
Tseveendorj, Ider (2006)
Journal of Applied Mathematics and Decision Sciences
Similarity:
On convergence of a global search strategy for reverse convex problems.
Strekalovsky, Alexander (2005)
Journal of Applied Mathematics and Decision Sciences
Similarity:
On generalized derivatives for vector optimization problems.
La Torre, Davide (2003)
Journal of Applied Mathematics
Similarity:
Monotonicity of the Lagrangian function in the parametric interior point methods of convex programming.
Hamala, M., Halická, M. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
A globally convergent non-interior point algorithm with full Newton step for second-order cone programming
Liang Fang, Guoping He, Li Sun (2009)
Applications of Mathematics
Similarity:
A non-interior point algorithm based on projection for second-order cone programming problems is proposed and analyzed. The main idea of the algorithm is that we cast the complementary equation in the primal-dual optimality conditions as a projection equation. By using this reformulation, we only need to solve a system of linear equations with the same coefficient matrix and compute two simple projections at each iteration, without performing any line search. This algorithm can start...
Remarks on second order generalized derivatives for differentiable functions with Lipschitzian Jacobian.
La Torre, Davide, Rocca, Matteo (2003)
Applied Mathematics E-Notes [electronic only]
Similarity: