scientific article; zbMATH DE number 7694509
From MaRDI portal
Publication:6155210
zbMath1524.49066MaRDI QIDQ6155210
Publication date: 12 June 2023
Full work available at URL: http://121.43.60.238/sxwlxbA/EN/abstract/abstract16688.shtml
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
constraint qualificationmixed type dualityapproximate optimality conditionsnon-convex constraint optimization problem
Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Cites Work
- Unnamed Item
- Unnamed Item
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- On Minty variational principle for nonsmooth vector optimization problems with approximate convexity
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- On representations of the feasible set in convex optimization
- Wolfe duality and Mond-Weir duality via perturbations
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- Optimality conditions in convex optimization revisited
- Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications
- Nonsmooth semi-infinite multiobjective optimization problems
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
- Optimality conditions for convex semi-infinite programming problems
- ε-Subdifferential and ε-monotonicity
- Obituary
- New Farkas-type constraint qualifications in convex infinite programming
This page was built for publication:
