Pages that link to "Item:Q5641019"
From MaRDI portal
The following pages link to Duality in Nonlinear Programming: A Simplified Applications-Oriented Development (Q5641019):
Displaying 50 items.
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem (Q427361) (← links)
- An homage to Joseph-Louis Lagrange and Pierre Huard (Q537596) (← links)
- Least-norm linear programming solution as an unconstrained minimization problem (Q593978) (← links)
- Generalized Benders' decomposition for topology optimization problems (Q652657) (← links)
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs (Q662860) (← links)
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization (Q700712) (← links)
- Decision making under uncertainty: A semi-infinite programming approach (Q760341) (← links)
- Ein Subgradientenverfahren zur Klassifikation qualitativer Daten (Q761244) (← links)
- On a pair of nonlinear mixed integer programming problems (Q761353) (← links)
- Convexity and concavity properties of the optimal value function in parametric nonlinear programming (Q762065) (← links)
- Convexity and differentiability of controlled risk (Q813113) (← links)
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872) (← links)
- Duality and symmetry in constrained estimation and control problems (Q858957) (← links)
- Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint (Q987514) (← links)
- Branch-and-reduce algorithm for convex programs with additional multiplicative constraints (Q1042085) (← links)
- On the characterization of noninferior solutions of the vector optimization problem (Q1050907) (← links)
- A continuous-time generalization of Gordan's transposition theorem (Q1072454) (← links)
- 'Multidimensional' extensions and a nested dual approach for the m-median problem (Q1072925) (← links)
- Optimality conditions and Lagrangian duality in continuous-time nonlinear programming (Q1074501) (← links)
- Dual gradient method for linearly constrained, strongly convex, separable mathematical programming problems (Q1078076) (← links)
- The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm (Q1083379) (← links)
- Lagrangean relaxation and decomposition in an uncapacitated 2-hierarchal location-allocation problem (Q1086126) (← links)
- A characterization of lower semicontinuity of constraint sets (Q1100096) (← links)
- Sublinear upper bounds for stochastic programs with recourse (Q1115346) (← links)
- Pre-invex functions in multiple objective optimization (Q1115356) (← links)
- An algorithm for generating efficient solutions of multiobjective dynamic programming problems (Q1129968) (← links)
- Generalization of Fenchel's duality theorem for convex vector optimization (Q1135212) (← links)
- Existence of optimal Lagrange multipliers for certain nonconvex allocation problems (Q1138233) (← links)
- Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems (Q1141356) (← links)
- A note on the duality gap in nonconvex optimization and a very simple procedure for bid evaluation type problems (Q1145624) (← links)
- Fractional programming: Applications and algorithms (Q1148821) (← links)
- Optimization of geometry in truss design (Q1155435) (← links)
- Duality theory for maximizations with respect to cones (Q1159085) (← links)
- A strengthened test for optimality (Q1159136) (← links)
- The diagonalizability of quadratic functions and the arbitrariness of shadow prices (Q1181978) (← links)
- Decentralized optimization for distributed-lag models of discrete systems (Q1221384) (← links)
- On the Pironneau-Polak method of centers (Q1221698) (← links)
- Characterization of optimality in convex programming without a constraint qualification (Q1226443) (← links)
- The optimization of non-linear systems using a new two level method (Q1229437) (← links)
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation (Q1235959) (← links)
- A dual convex homogeneous programming problem (Q1239685) (← links)
- A subgradient duality theorem (Q1243230) (← links)
- Existence of efficient solutions for vector maximization problems (Q1245164) (← links)
- Optimal control of constrained problems by the costate coordination structure (Q1246730) (← links)
- Four solution techniques for a general one machine scheduling problem. A comparative study (Q1247365) (← links)
- An interactive method as an aid in solving multi-objective mathematical programming problems (Q1249521) (← links)
- Decomposition and coordination methods for constrained optimization (Q1250049) (← 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)
- Zero duality gaps in infinite-dimensional programming (Q1263531) (← links)
