Local saddle point and a class of convexification methods for nonconvex optimization problems
From MaRDI portal
Publication:2460140
DOI10.1007/S10898-006-9090-4zbMATH Open1175.90317OpenAlexW2014939542MaRDI QIDQ2460140FDOQ2460140
Panos M. Pardalos, Yanjun Wang, Tao Li, Zhian Liang
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A duality theorem for non-linear programming
- Zero duality gap for a class of nonconvex optimization problems
- Local convexification of the Lagrangian function in nonconvex optimization
- Local saddle points and convexification for nonconvex optimization problems
Cited In (17)
- Duality for a fractional variational formulation using $\eta$-approximated method
- On the Absence of Spurious Local Trajectories in Time-Varying Nonconvex Optimization
- Saddle points of general augmented Lagrangians for constrained nonconvex optimization
- On equivalence between a variational problem and its modified variational problem with the Ξ·βobjective function under invexity
- A review of recent advances in global optimization
- An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems
- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- A survey of hidden convex optimization
- Hidden convex minimization
- Title not available (Why is that?)
- Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method
- Second order modified objective function method for twice differentiable vector optimization problems over cone constraints
- Title not available (Why is that?)
- Finding Gateaux-Saddles by a Local Minimax Method
- Global saddle points of nonlinear augmented Lagrangian functions
- Strong duality in optimization: shifted power reformulation
- Lokale konvergenzeigenschaften einer klasse von iterationsverfahren der nichtlinearen optimierung
Recommendations
- Local saddle points and convexification for nonconvex optimization problems π π
- Local convexification of the Lagrangian function for nonlinear nonconvex optimization π π
- Local convexification of the Lagrangian function in nonconvex optimization π π
- On saddle points and optima for non-smooth and non-convex programs π π
- Local minima of nonconvex problems π π
- A local minimax characterization for computing multiple nonsmooth saddle critical points π π
- Local saddle points for unconstrained polynomial optimization π π
- Title not available (Why is that?) π π
- Saddle point generation in nonlinear nonconvex optimization π π
- On saddle points in nonconvex semi-infinite programming π π
This page was built for publication: Local saddle point and a class of convexification methods for nonconvex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460140)
