Multiobjective DC programs with infinite convex constraints
From MaRDI portal
Publication:2249821
DOI10.1007/s10898-013-0091-9zbMath1326.90067OpenAlexW2031890443MaRDI QIDQ2249821
Mark Goh, Soon-Yi Wu, Robert de Souza, Shao-Jian Qu
Publication date: 3 July 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-013-0091-9
dualityoptimalitysaddle point(weak) Pareto efficiencymultiobjective DC programs with infinite convex constraints
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48)
Related Items (6)
The proximal point method with a vectorial Bregman regularization in multiobjective DC programming ⋮ Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions ⋮ Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints ⋮ Proximal point algorithms for convex multi-criteria optimization with applications to supply chain risk management ⋮ Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels ⋮ On \(q\)-Newton's method for unconstrained multiobjective optimization problems
Cites Work
- Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Semi-infinite programming
- Semiparametric duality models for semiinfinite multi-objective fractional programming problems containing generalized \( (\alpha, \eta, \rho)\)-V-invex functions
- Optimality conditions for vector optimization problems
- On sufficiency of the Kuhn-Tucker conditions
- A saddle-point characterization of Pareto optima
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Dual conditions characterizing optimality for convex multi-objective programs.
- A smoothing Newton method for semi-infinite programming
- Smooth convex approximation to the maximum eigenvalue function
- Optimality and duality for the multiobjective fractional programming with the generalized \((F,\rho)\) convexity.
- Semi-infinite programming, duality, discretization and optimality conditions†
- Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
- New Farkas-type constraint qualifications in convex infinite programming
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Multiobjective DC programs with infinite convex constraints
