Computational discretization algorithms for functional inequality constrained optimization
From MaRDI portal
Recommendations
- A computational algorithm for functional inequality constrained optimization problems
- scientific article; zbMATH DE number 1054761
- A simple computational procedure for optimization problems with functional inequality constraints
- Approximation and optimization of discrete and differential inclusions described by inequality constraints
- A new computational method for the functional inequality constrained minimax optimization problem
- scientific article; zbMATH DE number 2143830
- scientific article; zbMATH DE number 829961
- A numerical approach to optimization problems with variational inequality constraints
- Approximation schemes for functional optimization problems
- Algorithms for the variational inequalities and fixed point problems
Cited in
(31)- A smoothing projected Newton-type algorithm for semi-infinite programming
- An approach for solving fuzzy implicit variational inequalities with linear membership functions
- A new computational method for the functional inequality constrained minimax optimization problem
- 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 smoothing Newton method for semi-infinite programming
- A dual parametrization approach to Nyquist filter design
- A new adaptive method to nonlinear semi-infinite programming
- On sparse beamformer design with reverberation
- A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
- Global convergence of a robust smoothing SQP method for semi-infinite programming
- Robust envelope-constrained filter with orthonormal bases and semi-definite and semi-infinite programming
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- An M-objective penalty function algorithm under big penalty parameters
- An iterative method for solving KKT system of the semi-infinite programming
- Monotone smoothing splines using general linear systems
- Feasible method for semi-infinite programs
- scientific article; zbMATH DE number 1054761 (Why is no real title available?)
- Generalized quadratic augmented Lagrangian methods with nonmonotone penalty parameters
- Solving semi-infinite programs by smoothing projected gradient method
- A solution method for combined semi-infinite and semi-definite programming
- On solving the convex semi-infinite minimax problems via superlinear \(\mathcal{VU}\) incremental bundle technique with partial inexact oracle
- A modified exchange algorithm for distributional robust optimization and applications in risk management
- Polynomial optimization relaxations for generalized semi-infinite programs
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
- A new approach to the weighted peak-constrained least-square error FIR digital filter optimal design problem
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
- On the smoothing of the square-root exact penalty function for inequality constrained optimization
- A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints
- New approach for the nonlinear programming with transient stability constraints arising from power systems
- A new smoothing Newton-type algorithm for semi-infinite programming
This page was built for publication: Computational discretization algorithms for functional inequality constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5933818)
