Pages that link to "Item:Q5933818"

The following pages link to Computational discretization algorithms for functional inequality constrained optimization (Q5933818):

Displaying 29 items.

• Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
• An M-objective penalty function algorithm under big penalty parameters (Q328083) (← links)
• Generalized quadratic augmented Lagrangian methods with nonmonotone penalty parameters (Q442809) (← links)
• Solving semi-infinite programs by smoothing projected gradient method (Q480937) (← links)
• Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems (Q694542) (← links)
• A new approach to the weighted peak-constrained least-square error FIR digital filter optimal design problem (Q763402) (← links)
• The CoMirror algorithm with random constraint sampling for convex semi-infinite programming (Q828836) (← links)
• On the smoothing of the square-root exact penalty function for inequality constrained optimization (Q861516) (← links)
• A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints (Q929614) (← links)
• New approach for the nonlinear programming with transient stability constraints arising from power systems (Q967215) (← links)
• A new smoothing Newton-type algorithm for semi-infinite programming (Q969747) (← links)
• A smoothing projected Newton-type algorithm for semi-infinite programming (Q1001204) (← links)
• An approach for solving fuzzy implicit variational inequalities with linear membership functions (Q1005832) (← links)
• A new computational method for the functional inequality constrained minimax optimization problem (Q1356866) (← links)
• An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems (Q1717575) (← links)
• Filter trust region method for nonlinear semi-infinite programming problem (Q1720831) (← links)
• A smoothing Newton method for semi-infinite programming (Q1777435) (← links)
• A dual parametrization approach to Nyquist filter design (Q1957912) (← links)
• A new adaptive method to nonlinear semi-infinite programming (Q2076380) (← links)
• On sparse beamformer design with reverberation (Q2295315) (← links)
• A smoothing Levenberg-Marquardt algorithm for semi-infinite programming (Q2352422) (← links)
• Global convergence of a robust smoothing SQP method for semi-infinite programming (Q2370033) (← links)
• Robust envelope-constrained filter with orthonormal bases and semi-definite and semi-infinite programming (Q2454635) (← links)
• An iterative method for solving KKT system of the semi-infinite programming (Q3369516) (← links)
• Monotone Smoothing Splines using General Linear Systems (Q3454401) (← links)
• Feasible Method for Semi-Infinite Programs (Q3461986) (← links)
• A solution method for combined semi-infinite and semi-definite programming (Q4831772) (← links)
• On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle (Q5024906) (← links)
• A modified exchange algorithm for distributional robust optimization and applications in risk management (Q6092503) (← links)