Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
From MaRDI portal
Publication:2564166
Recommendations
- Lagrangian duality theorems for reverse convex infimization
- Lagrangian duality for minimization of nonconvex multifunctions
- scientific article; zbMATH DE number 970337
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Convergence of Lagrange Multipliers and Dual Variables for Convex Optimization Problems
- Lagrange duality for evenly convex optimization problems
- Lagrangian duality and cone convexlike functions
- Conjugate duality for concave maximization problems and applications
- Conjugate duality in convex optimization
- The Lagrangian duality in the special nonconvex problem of global optimization
Cites work
- scientific article; zbMATH DE number 3972625 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 592648 (Why is no real title available?)
- scientific article; zbMATH DE number 757675 (Why is no real title available?)
- scientific article; zbMATH DE number 757676 (Why is no real title available?)
- A finite cutting plane method for facial disjunctive programs
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- A global optimization approach for the linear two-level program
- A penalty function approach for solving bi-level linear programs
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- Bilevel linear programming
- Constrained global optimization: algorithms and applications
- Convex Analysis
- Disjunctive Programming
- Lagrangean duality for facial programs with applications to integer and complementarity problems
- Methods for Global Concave Minimization: A Bibliographic Survey
- Minimization of a quasi-concave function over an efficient set
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- On the global minimization of concave functions
- Optimization over the efficient set
- Optimizing a linear function over an efficient set
- Penalty for zero–one integer equivalent problem
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
Cited in
(6)- ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS
- Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Lagrangean duality for facial programs with applications to integer and complementarity problems
- Penalty parameter for linearly constrained 0--1 quadratic programming
- Technical efficiency and distance to a reverse convex set
- Deriving the properties of linear bilevel programming via a penalty function approach
This page was built for publication: Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2564166)
