Computational discretization algorithms for functional inequality constrained optimization
From MaRDI portal
Publication:5933818
DOI10.1023/A:1019260508329zbMath0990.90116MaRDI QIDQ5933818
No author found.
Publication date: 14 June 2001
Published in: Annals of Operations Research (Search for Journal in Brave)
convergence analysisadaptive methoddiscretization methodfunctional inequality constrained optimization problem
Nonlinear programming (90C30) Semi-infinite programming (90C34) Discrete approximations in optimal control (49M25)
Related Items (28)
The CoMirror algorithm with random constraint sampling for convex semi-infinite programming ⋮ Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ Global convergence of a robust smoothing SQP method for semi-infinite programming ⋮ Monotone Smoothing Splines using General Linear Systems ⋮ Feasible Method for Semi-Infinite Programs ⋮ An M-objective penalty function algorithm under big penalty parameters ⋮ On the smoothing of the square-root exact penalty function for inequality constrained optimization ⋮ A solution method for combined semi-infinite and semi-definite programming ⋮ A modified exchange algorithm for distributional robust optimization and applications in risk management ⋮ Generalized quadratic augmented Lagrangian methods with nonmonotone penalty parameters ⋮ A dual parametrization approach to Nyquist filter design ⋮ An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems ⋮ Filter trust region method for nonlinear semi-infinite programming problem ⋮ A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints ⋮ Robust envelope-constrained filter with orthonormal bases and semi-definite and semi-infinite programming ⋮ Solving semi-infinite programs by smoothing projected gradient method ⋮ Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems ⋮ New approach for the nonlinear programming with transient stability constraints arising from power systems ⋮ A new smoothing Newton-type algorithm for semi-infinite programming ⋮ A smoothing Newton method for semi-infinite programming ⋮ A smoothing projected Newton-type algorithm for semi-infinite programming ⋮ An iterative method for solving KKT system of the semi-infinite programming ⋮ An approach for solving fuzzy implicit variational inequalities with linear membership functions ⋮ On sparse beamformer design with reverberation ⋮ A new approach to the weighted peak-constrained least-square error FIR digital filter optimal design problem ⋮ A new adaptive method to nonlinear semi-infinite programming ⋮ On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle ⋮ A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
This page was built for publication: Computational discretization algorithms for functional inequality constrained optimization
