Lagrange Multipliers and Nonconvex Programs
From MaRDI portal
Publication:5576681
DOI10.1137/0307039zbMath0184.44404MaRDI QIDQ5576681
Publication date: 1969
Published in: SIAM Journal on Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0307039
Related Items
Estimation theory for nonlinear models and set membership uncertainty, Jointly constrained bilinear programs and related problems: An overview, New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability, Existence and sum decomposition of vertex polyhedral convex envelopes, A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization, Using convex envelopes to solve the interactive fixed-charge linear programming problem, A note on the duality gap in nonconvex optimization and a very simple procedure for bid evaluation type problems, Optimal estimation theory for dynamic systems with set membership uncertainty: An overview, Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming, Generalized bilinear programming. I: Models, applications and linear programming relaxation, A new reformulation-linearization technique for bilinear programming problems, Target set reachability criteria for dynamical systems described by inaccurate models, Lagrange duality and partitioning techniques in nonconvex global optimization, Bounds for global optimization of capacity expansion and flow assignment problems, Duality gaps in nonconvex stochastic optimization, An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes, On solving nonconvex optimization problems by reducing the duality gap, On a primal-proximal heuristic in discrete optimization, A primal-proximal heuristic applied to the French unit-commitment problem, Separable convexification and DCA techniques for capacity and flow assignment problems, Supports and convex envelopes, Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual
