A subgradient duality theorem

DOI10.1016/0022-247X(77)90183-4zbMATH Open0369.90104OpenAlexW2088016727MaRDI QIDQ1243230FDOQ1243230

Authors: Murray Schechter 

Publication date: 1977

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(77)90183-4

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Title not available (Why is that?)
• A class of nondifferentiable mathematical programming problems
• A duality theorem for non-linear programming
• Title not available (Why is that?)
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• A programming problem with an L_p norm in the objective function
• A Solvability Theorem for Homogeneous Functions
• A Note on Duality Theorem for a Nonlinear Programming Problem

Cited In (29)

• Optimality conditions and duality models for a class of nonsmooth constrained fractional variational problems
• Subgradient Duality Using jFritz John Conditions
• \(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions
• Optimality and duality for nonsmooth multiobjective programming problems with \(V\)-\(r\)-invexity
• On nonlinear programming with support functions
• Vector optimization over cones involving support functions using generalized \((\Phi,\rho)\)-convexity
• Nondifferentiable mathematical programming and convex-concave functions
• More on subgradient duality
• Duality for a class of nondifferentiable mathematical programming problems
• LIPSCHITZr-INVEX FUNCTIONS AND NONSMOOTH PROGRAMMING
• A singularly perturbed Cauchy problem
• Constraint qualifications in a class of nondifferentiable mathematical programming problems
• A variational-like inequality for multifunctions with applications
• Nondifferentiable optimization by smooth approximations
• Moreau-Rockafellar type theorem for convex set functions
• Hanson's duality theorem in nonsmooth programming
• Title not available (Why is that?)
• A dual problem for convex programming in ordered vector spaces
• Wolfe duality and Mond-Weir duality via perturbations
• Duality and existence theory for nondifferentiable programming
• A duality theorem for nondifferentiable convex programming with operatorial constraints
• Duality theorem of nondifferentiable convex multiobjective programming
• \((\Phi , \rho )\)-invexity in nonsmooth optimization
• A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
• Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
• A linear complementarity problem involving a subgradient
• On sufficiency of the Kuhn-Tucker conditions in nondifferentiable programming
• Generalized concavity and duality with a square root term
• Higher-order duality for multiobjective optimization problems containing support functions over cones

This page was built for publication: A subgradient duality theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1243230)