Pages that link to "Item:Q2526613"

The following pages link to Lagrange multipliers and nonlinear programming (Q2526613):

Displaying 20 items.

• Sequential approximate optimization using dual subproblems based on incomplete series expansions (Q373981) (← links)
• Approximated approximations for SAO (Q381410) (← links)
• First-order sequential convex programming using approximate diagonal QP subproblems (Q381733) (← links)
• On convex transformability and the solution of nonconvex problems via the dual of Falk (Q381823) (← links)
• Positive definite separable quadratic programs for non-convex problems (Q381897) (← links)
• On concave constraint functions and duality in predominantly black-and-white topology optimization (Q658835) (← links)
• Lagrangian coordination and analytical target cascading: Solving ATC-decomposed problems with Lagrangian duality (Q833393) (← links)
• New overlapping coordination methodologies for large-scale optimization problems (Q1181565) (← links)
• Unconstrained duals to partially separable constrained programs (Q1196186) (← links)
• Convexification procedures and decomposition methods for nonconvex optimization problems (Q1251185) (← links)
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality (Q1257414) (← links)
• Structural shape optimization for the torsion problem using direct integration and \(B\)-splines (Q1309664) (← links)
• A theorem of the alternative with application to convex programming: optimality, duality, and stability (Q2557650) (← links)
• A quadratic approximation for structural topology optimization (Q3567284) (← links)
• The complementary unboundedness of dual feasible solution sets in convex programming (Q4138493) (← links)
• On sequential approximate simultaneous analysis and design in classical topology optimization (Q5273351) (← links)
• Non‐convex dual forms based on exponential intervening variables, with application to weight minimization (Q5306430) (← links)
• A relaxed interior approach to nonlinear programming (Q5554056) (← links)
• Penalty function versus non-penalty function methods for constrained nonlinear programming problems (Q5653813) (← links)
• Exact penalty functions in nonlinear programming (Q5684512) (← links)