Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
From MaRDI portal
Publication:1771100
DOI10.1023/B:JOTA.0000043992.38554.c8zbMath1114.90091OpenAlexW2059748770MaRDI QIDQ1771100
Publication date: 7 April 2005
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:jota.0000043992.38554.c8
Semidefinite programming (90C22) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32) Programming in abstract spaces (90C48)
Related Items (35)
Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) ⋮ Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems ⋮ An approach to characterizing \(\epsilon\)-solution sets of convex programs ⋮ Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities ⋮ Linear fractional optimization problems on Jordan Euclidean algebras ⋮ Some new properties of the Lagrange function and its applications ⋮ A new approach to characterize the solution set of a pseudoconvex programming problem ⋮ On characterizing solution set of non-differentiable η-pseudolinear extremum problem ⋮ Characterizations of the solution set for tangentially convex optimization problems ⋮ Characterizations of the solution set for non-essentially quasiconvex programming ⋮ Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials ⋮ Characterizations of solution sets of differentiable quasiconvex programming problems ⋮ Generalized weak sharp minima in cone-constrained convex optimization with applications ⋮ A note on characterizing solution set of nonsmooth pseudoinvex optimization problem ⋮ Characterizing the solution set of convex optimization problems without convexity of constraints ⋮ The characterizations of optimal solution set in programming problem under inclusion constrains ⋮ On characterizations of solution sets of interval-valued quasiconvex programming problems ⋮ Characterizations of the solution set for a class of nonsmooth optimization problems ⋮ Unnamed Item ⋮ Characterizations of solution sets of cone-constrained convex programming problems ⋮ Extended Farkas's lemmas and strong dualities for conic programming involving composite functions ⋮ Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems ⋮ \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints ⋮ Characterizing robust solution sets of convex programs under data uncertainty ⋮ Characterizations of solution sets of convex vector minimization problems ⋮ Characterization of solution sets of convex optimization problems in Riemannian manifolds ⋮ Optimality conditions and total dualities for conic programming involving composite function ⋮ On characterizing the solution sets of pseudoinvex extremum problems ⋮ Second-order optimality conditions and Lagrange multiplier characterizations of the solution set in quasiconvex programming ⋮ Characterizations of the nonemptiness and Boundedness of weakly efficient solution sets of Convex vector optimization problems in real reflexive Banach spaces ⋮ Characterizations of optimal solution sets of convex infinite programs ⋮ Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials ⋮ Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers ⋮ Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints ⋮ Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
Cites Work
- Unnamed Item
- Unnamed Item
- Convex composite multi-objective nonsmooth programming
- A simple characterization of solutions sets of convex programs
- Generalizations of Slater's constraint qualification for infinite convex programs
- Zero duality gaps in infinite-dimensional programming
- Characterizations of strict local minima and necessary conditions for weak sharp minima
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
- Dual conditions characterizing optimality for convex multi-objective programs.
- On characterizing the solution sets of pseudolinear programs
- Characterization of solution sets of convex programs
- Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions
- Weak Sharp Minima: Characterizations and Sufficient Conditions
- Solution point characterizations and convergence analysis of a descent algorithm for nonsmooth continuous complementarity problems.
This page was built for publication: Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
