Local saddle point and a class of convexification methods for nonconvex optimization problems

DOI10.1007/S10898-006-9090-4MaRDI QIDQ2460140zbMATH OpenOpenAlexFDO

Authors Tao Li, Zhian Liang, Panos M. Pardalos, Yanjun 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

zbMATH Keywords

nonconvex optimizationconvexificationlocal convexitylocal saddle point

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

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

• scientific article; zbMATH DE number 417962 (Why is no real title available?)
• scientific article; zbMATH DE number 3912096 (Why is no real title available?)
• A duality theorem for non-linear programming
• 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

(19)

• Local convergence of the heavy-ball method and iPiano for non-convex optimization
• Local convexification of the Lagrangian function for nonlinear nonconvex optimization
• Strong duality in optimization: shifted power reformulation
• A review of recent advances in global optimization
• scientific article; zbMATH DE number 3887457 (Why is no real title available?)
• An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems
• Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method
• 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
• Hidden convex minimization
• scientific article; zbMATH DE number 4139503 (Why is no real title available?)
• 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 of general augmented Lagrangians for constrained nonconvex optimization
• An equivalent problem in nonconvex semidefinite programming
• Finding Gateaux-Saddles by a Local Minimax Method
• Lokale konvergenzeigenschaften einer klasse von iterationsverfahren der nichtlinearen optimierung

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)