New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
From MaRDI portal
Publication:4441971
DOI10.1137/S1052623402417699zbMath1046.90059MaRDI QIDQ4441971
No author found.
Publication date: 19 January 2004
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
necessary and sufficient conditions\(\varepsilon\)-subdifferentialsequential \(\epsilon\)-subgradient optimality conditions
Convex programming (90C25) Convex functions and convex programs in convex geometry (52A41) Calculus of functions on infinite-dimensional spaces (26E15)
Related Items
Sequential \(\varepsilon\)-subdifferential calculus for scalar and vector mappings ⋮ Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) ⋮ On \(\epsilon\)-solutions for convex optimization problems with uncertainty data ⋮ Stable and total Fenchel duality for composed convex optimization problems ⋮ Optimality theorems for linear fractional optimization problems involving integral functions defined on Cn [0,1] ⋮ Study of a special nonlinear problem arising in convex semi-infinite programming ⋮ On strong duality in linear copositive programming ⋮ On approximate efficiency for nonsmooth robust vector optimization problems ⋮ Sequential approximate weak optimality conditions for multiobjective fractional programming problems via sequential calculus rules for the Brøndsted-Rockafellar approximate subdifferential ⋮ Liberating the subgradient optimality conditions from constraint qualifications ⋮ Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness ⋮ On approximate solutions for robust convex semidefinite optimization problems ⋮ Characterizations of robust solution set of convex programs with uncertain data ⋮ Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint ⋮ Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization ⋮ Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps ⋮ Linear fractional optimization problems on Jordan Euclidean algebras ⋮ \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints ⋮ New strong duality results for convex programs with separable constraints ⋮ On quasi \(\epsilon\)-solution for robust convex optimization problems ⋮ Sequential Pareto subdifferential sum rule for convex set-valued mappings and applications ⋮ Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization ⋮ Sequential optimality conditions of approximate proper efficiency for a multiobjective fractional programming problem ⋮ Implicit optimality criterion for convex SIP problem with box constrained index set ⋮ Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces ⋮ Robust conjugate duality for convex optimization under uncertainty with application to data classification ⋮ New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs ⋮ Optimality theorems for convex semidefinite vector optimization problems ⋮ Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty ⋮ Sequential subdifferential for multi-composed functions via perturbation approach ⋮ SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS ⋮ Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs ⋮ Role of \((\rho , \eta , A)\)-invexity to \(\varepsilon \)-optimality conditions for multiple objective fractional programming ⋮ On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems ⋮ Optimality conditions of robust convex multiobjective optimization viaε-constraint scalarization and image space analysis ⋮ Stable zero Lagrange duality for DC conic programming ⋮ Unnamed Item ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ A note on optimality conditions for DC programs involving composite functions ⋮ Farkas-type results for constrained fractional programming with DC functions ⋮ On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods ⋮ A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions ⋮ A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials ⋮ Differential conditions for constrained nonlinear programming via Pareto optimization ⋮ On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint ⋮ Unnamed Item ⋮ On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets ⋮ A simple closure condition for the normal cone intersection formula ⋮ Optimality criteria without constraint qualifications for linear semidefinite problems ⋮ \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints ⋮ A closedness condition and its applications to DC programs with convex constraints ⋮ Sequential optimality conditions for composed convex optimization problems ⋮ \(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions ⋮ Sequential optimality conditions for fractional optimization with applications to vector optimization ⋮ A new class of alternative theorems for SOS-convex inequalities and robust optimization ⋮ The strong conical hull intersection property for convex programming ⋮ New Farkas-type constraint qualifications in convex infinite programming ⋮ An alternative formulation for a new closed cone constraint qualification ⋮ Unnamed Item ⋮ Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming ⋮ Optimality and duality in nonsmooth conic vector optimization ⋮ A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty ⋮ Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices ⋮ Sequential Lagrangian conditions for convex programs with applications to semidefinite programming ⋮ Characterizations of solution sets of convex vector minimization problems ⋮ Approximate optimality conditions for minimax programming problems ⋮ Sequential optimality conditions for multiobjective fractional programming problems ⋮ Simple bilevel programming and extensions ⋮ A Global Approach to Nonlinearly Constrained Best Approximation ⋮ On robust duality for fractional programming with uncertainty data ⋮ On set containment characterizations for sets described by set-valued maps with applications ⋮ Unnamed Item ⋮ \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints ⋮ Optimality conditions and duality for DC programming in locally convex spaces ⋮ The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces ⋮ Strong duality for standard convex programs ⋮ On \(\epsilon\)-solutions for robust semi-infinite optimization problems ⋮ Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation ⋮ Lagrange multipliers for set-valued optimization problems associated with coderivatives ⋮ Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming ⋮ On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization ⋮ A new geometric condition for Fenchel's duality in infinite dimensional spaces ⋮ Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems ⋮ On \(\epsilon\)-solutions for robust fractional optimization problems
This page was built for publication: New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
