Local saddle point and a class of convexification methods for nonconvex optimization problems
From MaRDI portal
Publication:2460140
A class of general transformation methods is proposed to convert a nonconvex optimization problem to another equivalent problem. It is shown that under certain assumptions the existence of a local saddle point or local convexity of the Lagrangian function of the equivalent problem can be guaranteed. Numerical experiments are given to demonstrate the main results geometrically.
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
- scientific article; zbMATH DE number 4139503
- Saddle point generation in nonlinear nonconvex optimization
- On saddle points in nonconvex semi-infinite programming
Cites work
- A duality theorem for non-linear programming
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- Local convexification of the Lagrangian function in nonconvex optimization
- Local saddle points and convexification for nonconvex optimization problems
- Zero duality gap for a class of nonconvex optimization problems
Cited in
(22)- Local saddle points and convexification for nonconvex optimization problems
- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- Hidden convex minimization
- Local convexification of the Lagrangian function in nonconvex optimization
- A survey of hidden convex optimization
- Second order modified objective function method for twice differentiable vector optimization problems over cone constraints
- Global saddle points of nonlinear augmented Lagrangian functions
- Strong duality in optimization: shifted power reformulation
- An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems
- Finding Gateaux-Saddles by a Local Minimax Method
- scientific article; zbMATH DE number 3887457 (Why is no real title available?)
- An equivalent problem in nonconvex semidefinite programming
- scientific article; zbMATH DE number 4139503 (Why is no real title available?)
- Lokale konvergenzeigenschaften einer klasse von iterationsverfahren der nichtlinearen optimierung
- Saddle point generation in nonlinear nonconvex optimization
- Local convexification of the Lagrangian function for nonlinear nonconvex optimization
- On equivalence between a variational problem and its modified variational problem with the η‐objective function under invexity
- Duality for a fractional variational formulation using \eta-approximated method
- On the Absence of Spurious Local Trajectories in Time-Varying Nonconvex Optimization
- Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method
- Saddle points of general augmented Lagrangians for constrained nonconvex optimization
- A review of recent advances in global optimization
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)
