A duality theorem for non-linear programming
From MaRDI portal
Publication:3847864
DOI10.1090/QAM/135625zbMath0109.38406OpenAlexW2561178549MaRDI QIDQ3847864
Publication date: 1961
Published in: Quarterly of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/qam/135625
Related Items (only showing first 100 items - show all)
An \(\eta\)-approximation approach to duality in mathematical programming problems involving \(r\)-invex functions ⋮ On various duality theorems in nonlinear programming ⋮ Dantzig-Wolfe reformulations for binary quadratic problems ⋮ Mixed type duality for a programming problem containing support function. ⋮ Saddle point and generalized convex duality for multiobjective programming. ⋮ Optimality and duality in nonsmooth composite vector optimization and applications ⋮ Higher-order generalized Studniarski epiderivative and its applications in set-valued optimization ⋮ Sparsity-preserving SOR algorithms for separable quadratic and linear programming ⋮ The practical behavior of the homogeneous self-dual formulations in interior point methods ⋮ Conditions for solutions, their globality, and their duality relations in vector optimization with relaxed quasiconvexity ⋮ Generalized fractional programming duality: A parametric approach ⋮ Multiobjective duality with invexity ⋮ Existence of solutions for vector optimization ⋮ Non-linear integer programming: Sensitivity analysis for branch and bound ⋮ A converse duality theorem in multiple objective programming ⋮ Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems ⋮ Some characterizations of robust optimal solutions for uncertain convex optimization problems ⋮ An improved general Phase-I method in linear programming ⋮ On duality for mathematical programs with vanishing constraints ⋮ Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators ⋮ An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms ⋮ Pre-invex functions in multiple objective optimization ⋮ Optimality for set functions with values in ordered vector spaces ⋮ Continuous modular design problem: analysis and solution algorithms ⋮ Stability of linearly constrained convex quadratic programs ⋮ The Newton modified barrier method for QP problems ⋮ A singularly perturbed Cauchy problem ⋮ Duality for minmax \(B\)-vex programming involving \(n\)-set functions ⋮ Sequential approximate optimization using dual subproblems based on incomplete series expansions ⋮ On convex transformability and the solution of nonconvex problems via the dual of Falk ⋮ Some remarks on vector optimization problems ⋮ Duality for multiobjective fractional programming problem using convexifactors ⋮ More on subgradient duality ⋮ Duality in nonlinear programming ⋮ Unified duality theory for constrained extremum problems. II: Special duality schemes ⋮ A class of nondifferentiable mathematical programming problems ⋮ \(L^{p}\)-norms, log-barriers and Cramer transform in optimization ⋮ A study of some general problems of Dieudonné-Rashevski type ⋮ Duality for a class of nondifferentiable mathematical programming problems ⋮ Nondifferentiable higher order duality in multiobjective programming involving cones ⋮ Iteration processes of convex programming with internal regularization ⋮ \((p,r)\)-invexity in multiobjective programming. ⋮ Generalized \((F,\rho )\)-convexity and duality in nonsmooth problems of multiobjective optimization ⋮ Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions. ⋮ A realization of constraint feasibility in a moving least squares response surface based approximate optimization ⋮ The gap function of a convex program ⋮ Robust duality for generalized convex programming problems under data uncertainty ⋮ Isolated and proper efficiencies in semi-infinite vector optimization problems ⋮ Symmetric duality with pseudo-invexity in variational problems ⋮ Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators ⋮ Generalized higher-order cone-convex functions and higher-order duality in vector optimization ⋮ Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints ⋮ Local convexification of the Lagrangian function in nonconvex optimization ⋮ Optimality conditions and duality in nonsmooth multiobjective optimization problems ⋮ Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints ⋮ Duality for multiobjective variational problems ⋮ On efficiency and duality for multiobjective programs ⋮ A class of nonsmooth fractional multiobjective optimization problems ⋮ Separation of sets and Wolfe duality ⋮ Third order duality in nonlinear programming problems ⋮ Efficiency and generalized convex duality for nondifferentiable multiobjective programs ⋮ Duality for optimization problems in Banach algebras ⋮ Programming with semilocally convex functions ⋮ Nondifferentiable multiobjective Mond-Weir type second-order symmetric duality over cones ⋮ Symmetric duality with \((p,r)-\rho -(\eta,\theta)\)-invexity ⋮ Converse duality in Banach space ⋮ Logarithmic convexity and geometric programming ⋮ Some applications of mathematical programming to problems in mathematical physics ⋮ Wolfe duality and Mond-Weir duality via perturbations ⋮ Generalized type I invexity and duality in multiobjective variational problems ⋮ Second- and higher-order duality in nonlinear programming ⋮ Higher-order duality for multiobjective programming problems involving \({(F, \alpha, \rho, d)}\)-V-type I functions ⋮ A subgradient duality theorem ⋮ Optimality conditions and duality for nondifferentiable multiobjective programming problems involving \(d\)-\(r\)-type I functions ⋮ Duality in infinite-dimensional mathematical programming: Convex integral functionals ⋮ Dorn's duality for quadratic programs revisited: The nonconvex case ⋮ Wolfe duality for interval-valued optimization ⋮ Minimax fractional programming for \(n\)-set functions and mixed-type duality under generalized Invexity ⋮ Efficiency and generalized convex duality for multiobjective programs ⋮ Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions ⋮ Duality for multiobjective control problems with generalized invexity ⋮ Symmetric duality with invexity in variational problems ⋮ Implied constraints and an alternate unified development of nonlinear programming theory ⋮ Convexity and concavity properties of the optimal value function in parametric nonlinear programming ⋮ On \(G\)-invex multiobjective programming. II: Duality ⋮ Optimality and duality in nonsmooth multiobjective optimization involving generalized type I functions ⋮ Minimax programming under \((p,r)\)-invexity ⋮ Optimality and duality for nonsmooth multiobjective programming problems with \(V\)-\(r\)-invexity ⋮ Optimality conditions and duality for multiobjective semi-infinite programming on Hadamard manifolds ⋮ Duality in multiobjective nonlinear programming involving semilocally convex and related functions ⋮ On sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints ⋮ An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities ⋮ Optimality conditions and duality for continuous-time programming with multiple interval-valued objective functions ⋮ On incomplete Lagrange function and saddle point optimality criteria in mathematical programming ⋮ Structural shape optimization for the torsion problem using direct integration and \(B\)-splines ⋮ Duality theorem of nondifferentiable convex multiobjective programming ⋮ An interior point parameterized central path following algorithm for linearly constrained convex programming ⋮ On the classical logarithmic barrier function method for a class of smooth convex programming problems ⋮ Nonlinear complementarity as unconstrained and constrained minimization ⋮ Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
This page was built for publication: A duality theorem for non-linear programming
