Local saddle point and a class of convexification methods for nonconvex optimization problems
From MaRDI portal
Publication:2460140
DOI10.1007/s10898-006-9090-4zbMath1175.90317OpenAlexW2014939542MaRDI QIDQ2460140
Panos M. Pardalos, Tao Li, Zhi-An Liang, Yan-Jun Wang
Publication date: 14 November 2007
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9090-4
Related Items (10)
An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems ⋮ A review of recent advances in global optimization ⋮ Global saddle points of nonlinear augmented Lagrangian functions ⋮ A survey of hidden convex optimization ⋮ On equivalence between a variational problem and its modified variational problem with the η‐objective function under invexity ⋮ Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method ⋮ Duality for a fractional variational formulation using $\eta$-approximated method ⋮ Saddle points of general augmented Lagrangians for constrained nonconvex optimization ⋮ Second order modified objective function method for twice differentiable vector optimization problems over cone constraints ⋮ Strong duality in optimization: shifted power reformulation
Cites Work
This page was built for publication: Local saddle point and a class of convexification methods for nonconvex optimization problems