Lagrange Multipliers and Nonconvex Programs
From MaRDI portal
Publication:5576681
DOI10.1137/0307039zbMath0184.44404OpenAlexW1989778318MaRDI 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
Decomposition algorithm for large-scale two-stage unit-commitment, Using convex envelopes to solve the interactive fixed-charge linear programming problem, Optimizing stop plan and tickets allocation for high-speed railway based on uncertainty theory, An extended formulation for two-stage stochastic unit commitment with reserves, Lagrange duality and partitioning techniques in nonconvex global optimization, A note on the duality gap in nonconvex optimization and a very simple procedure for bid evaluation type problems, On the relation between concavity cuts and the surrogate dual for convex maximization problems, On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations, A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints, Jointly constrained bilinear programs and related problems: An overview, New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability, 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, Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program, Existence and sum decomposition of vertex polyhedral convex envelopes, Generalized bilinear programming. I: Models, applications and linear programming relaxation, Optimal spares allocation to an exchangeable-item repair system with tolerable wait, A new reformulation-linearization technique for bilinear programming problems, Duality gaps in nonconvex stochastic optimization, Separable convexification and DCA techniques for capacity and flow assignment problems, On solving nonconvex optimization problems by reducing the duality gap, An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes, Target set reachability criteria for dynamical systems described by inaccurate models, Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual, On a primal-proximal heuristic in discrete optimization, A primal-proximal heuristic applied to the French unit-commitment problem, Bounds for global optimization of capacity expansion and flow assignment problems, Estimation theory for nonlinear models and set membership uncertainty, A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization, Supports and convex envelopes
