Modified gradient sampling algorithm for nonsmooth semi-infinite programming

DOI10.1007/S12190-023-01928-XzbMATH Open1541.65043MaRDI QIDQ6578198

Ke Su, Tianyou Shang, Yanshu Wei, Bing Zhao

Publication date: 25 July 2024

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

zbMATH Keywords

nonsmoothsemi-infinite optimizationadaptive discretizationgradient samplingideal direction

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Semi-infinite programming (90C34)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
• A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
• A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
• An algorithm for finding the Chebyshev center of a convex polyhedron
• The design of FIR filters in the complex plane by convex optimization
• Semi-infinite programming and applications to minimax problems
• A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
• A filter proximal bundle method for nonsmooth nonconvex constrained optimization
• Methods of descent for nondifferentiable optimization
• The dual parameterization approach to optimal least square FIR filter design subject to maximum error constraints
• Duality in semi-infinite programs and some works of Haar and Carathéodory
• A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
• Introduction to Nonsmooth Optimization
• DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
• Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
• A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
• Numerical Nonsmooth Optimization
• A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
• A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
• An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
• On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions

This page was built for publication: Modified gradient sampling algorithm for nonsmooth semi-infinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6578198)