Comparative study of RPSALG algorithm for convex semi-infinite programming
From MaRDI portal
Publication:2515065
Recommendations
- Penalty and smoothing methods for convex semi-infinite programming
- On the convergence of a smoothed penalty algorithm for semi-infinite programming
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- A regularized penalty method for solving convex semi-infinite programs
- An unconstrained convex programming approach to convex semi-infinite programming
Cites work
- A dual parametrization method for convex semi-infinite programming
- A review of applications of the cutting angle methods
- A semi-infinite programming approach to identifying matrix-exponential distributions
- Abstract convexity and global optimization
- Benchmarking optimization software with performance profiles.
- Bounded lower subdifferentiability optimization techniques: applications
- Cutting angle method – a tool for constrained global optimization
- Duality of ellipsoidal approximations via semi-infinite programming
- Extended cutting angle method of global optimization
- Fast algorithm for the cutting angle method of global optimization
- Fixed-order \(H_\infty\) controller design for nonparametric models by convex optimization
- Geometry and combinatorics of the cutting angle method
- Global minimization of increasing positively homogeneous functions over the unit simplex
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 3016366 (Why is no real title available?)
- scientific article; zbMATH DE number 2243090 (Why is no real title available?)
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Modified versions of the cutting angle method.
- Newton's method for convex programming and Tschebyscheff approximation
- Numerical experiments with universal barrier functions for cones of Chebyshev systems
- Numerical Optimization
- Numerical treatment of an asset price model with non-stochastic uncertainty. (With comments and rejoinder).
- On the Stability of the Feasible Set in Optimization Problems
- Penalty and smoothing methods for convex semi-infinite programming
- Sensor Selection via Convex Optimization
- SIPAMPL
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(10)- A comparative study of several semi-infinite nonlinear programming algorithms
- Recent contributions to linear semi-infinite optimization
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
- Recent contributions to linear semi-infinite optimization: an update
- Marco A. López, a pioneer of continuous optimization in Spain
- Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach
- The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments
- RPSALG
- An exchange method with refined subproblems for convex semi-infinite programming problems
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
This page was built for publication: Comparative study of RPSALG algorithm for convex semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2515065)
