Minimizing sequences in a constrained DC optimization problem

DOI10.1134/s0081543823060214OpenAlexW4391740566MaRDI QIDQ6194921

Alexander S. Strekalovsky

Publication date: 16 February 2024

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0081543823060214

zbMATH Keywords

local searchlinearized problemminimizing sequenceglobal searchglobal optimality conditionsexact penaltyDC functioncritical vectorresolving approximation

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Numerical analysis (65-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On global search in nonconvex optimal control problems
• On local search in d.c. optimization problems
• On numerical solving the spherical separability problem
• Testing copositivity with the help of difference-of-convex optimization
• Exact penalty and error bounds in DC programming
• A line search exact penalty method using steering rules
• Three modeling paradigms in mathematical programming
• An approach to constrained global optimization based on exact penalty functions
• Frontiers in global optimization
• The BFGS method with exact line searches fails for non-convex objective functions
• A local search method for optimization problem with d.c. inequality constraints
• On the divergence of line search methods
• Global optimality conditions in nonconvex optimization
• Global optimality conditions and exact penalization
• Newton's iterates can converge to non-stationary points
• On Solving Optimization Problems with Hidden Nonconvex Structures
• Computing B-Stationary Points of Nonsmooth DC Programs
• DC Programming and DCA for General DC Programs
• An Exact Penalization Viewpoint of Constrained Optimization
• Error bounds and metric subregularity
• Exact Penalty Property in Optimization with Mixed Constraints via Variational Analysis
• Non-Linear Programming Via Penalty Functions
• Convex Analysis
• Numerical optimization. Theoretical and practical aspects. Transl. from the French