Solving semi-infinite programs by smoothing projected gradient method
From MaRDI portal
Publication:480937
DOI10.1007/s10589-014-9654-zzbMath1308.65101OpenAlexW2081084362MaRDI QIDQ480937
Soon-Yi Wu, Jane J. Ye, Mengwei Xu
Publication date: 12 December 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-014-9654-z
error boundvalue functionKarush-Kuhn-Tucker conditionsnumerical resultintegral entropy functionlocally optimal solutionnonlinear semi-infinite programming problemsmoothing projected gradient algorithm
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Semi-infinite programming (90C34)
Related Items
A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming ⋮ Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ Frameworks and results in distributionally robust optimization ⋮ Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints ⋮ Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models ⋮ An incremental bundle method for portfolio selection problem under second-order stochastic dominance ⋮ Optimality conditions for semi-infinite programming problems involving generalized convexity ⋮ A noninterior point homotopy method for semi-infinite programming problems ⋮ Decomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower games ⋮ Gradient-Based Solution Algorithms for a Class of Bilevel Optimization and Optimal Control Problems with a Nonsmooth Lower Level ⋮ Distributionally robust optimization. A review on theory and applications ⋮ On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
- Semi-infinite programming
- A one-phase algorithm for semi-infinite linear programming
- Generalized semi-infinite programming: a tutorial
- First order optimality conditions for generalized semi-infinite programming problems
- A new smoothing Newton-type algorithm for semi-infinite programming
- A smoothing projected Newton-type algorithm for semi-infinite programming
- Stability of indices in the KKT conditions and metric regularity in convex semi-infinite optimization
- A globally convergent SQP method for semi-infinite nonlinear optimization
- Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
- Optimization. Algorithms and consistent approximations
- Semismooth Newton methods for solving semi-infinite programming problems
- Bi-level strategies in semi-infinite programming.
- A smoothing Newton method for semi-infinite programming
- Global solution of semi-infinite programs
- Deterministic global optimization. Theory, methods and applications
- Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
- Relaxed cutting plane method for solving linear semi-infinite programming problems
- How to solve a semi-infinite optimization problem
- On solving simple bilevel programs with a nonconvex lower level program
- Minimizing the Condition Number of a Gram Matrix
- A New Exchange Method for Convex Semi-Infinite Programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- An iterative method for solving KKT system of the semi-infinite programming
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Semi-infinite programming, duality, discretization and optimality conditions†
- A projected lagrangian algorithm for semi-infinite programming
- Optimization and nonsmooth analysis
- Critical sets in parametric optimization
- On Linear Semi-Infinite Programming Problems: An Algorithm
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Numerical treatment of a class of semi‐infinite programming problems
- A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming
- Computational discretization algorithms for functional inequality constrained optimization
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- Discretization in semi-infinite programming: the rate of convergence
