A smoothing projected Newton-type algorithm for semi-infinite programming
From MaRDI portal
Publication:1001204
DOI10.1007/s10589-007-9117-xzbMath1153.90556OpenAlexW2050456393MaRDI QIDQ1001204
Liqun Qi, Chen Ling, Guanglu Zhou, Xiaojiao Tong
Publication date: 13 February 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11937/37908
Related Items
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, An entropic regularized method of centers for continuous minimax problem with semi infinite constraints, On the convergence of a smoothed penalty algorithm for semi-infinite programming, Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems, Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications, An augmented Lagrangian algorithm for solving semiinfinite programming, An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems, A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints, Solving semi-infinite programs by smoothing projected gradient method, A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations, Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems, A new smoothing Newton-type algorithm for semi-infinite programming, Smoothing methods for nonsmooth, nonconvex minimization, A Smoothing Projected Levenberg-Marquardt Type Algorithm for Solving Constrained Equations, On sparse beamformer design with reverberation, A smoothing Newton-type method for solving the \(L _{2}\) spectral estimation problem with lower and upper bounds, Interior point filter method for semi-infinite programming problems, Convergence properties of a class of exact penalty methods for semi-infinite optimization problems, An inexact primal-dual algorithm for semi-infinite programming, A smoothing approach for the optimal parameter selection problem with continuous inequality constraint, A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
Cites Work
- Unnamed Item
- Unnamed Item
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Optimization. Algorithms and consistent approximations
- A feasible semismooth asymptotically Newton method for mixed complementarity problems
- Semismooth Newton methods for solving semi-infinite programming problems
- Differentiability and semismoothness properties of integral functions and their applications
- A smoothing Newton method for semi-infinite programming
- A new computational algorithm for functional inequality constrained optimization problems
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A nonsmooth version of Newton's method
- Global convergence of a robust smoothing SQP method for semi-infinite programming
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- Nonsmooth Equations: Motivation and Algorithms
- Semi-Infinite Programming: Theory, Methods, and Applications
- An iterative method for solving KKT system of the semi-infinite programming
- A projected lagrangian algorithm for semi-infinite programming
- Optimization and nonsmooth analysis
- Projected gradient methods for linearly constrained problems
- Semismooth and Semiconvex Functions in Constrained Optimization
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Computational discretization algorithms for functional inequality constrained optimization
- Semi-infinite programming. Recent advances
- Discretization in semi-infinite programming: the rate of convergence
