The following pages link to Rembert Reemtsen (Q235025):
Displaying 50 items.
- Robust linear semi-infinite programming duality under uncertainty (Q353146) (← links)
- On the convergence of a smoothed penalty algorithm for semi-infinite programming (Q376724) (← links)
- A practical relative error criterion for augmented Lagrangians (Q378086) (← links)
- Solving the general quadratic programming problem in a finite number of steps (Q382174) (← links)
- Moment approximations for set-semidefinite polynomials (Q382904) (← links)
- First-order methods of smooth convex optimization with inexact oracle (Q403634) (← links)
- The space decomposition theory for a class of eigenvalue optimizations (Q457214) (← links)
- Primal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization (Q462993) (← links)
- Regularization and normal solutions of systems of linear equations and inequalities (Q492280) (← links)
- Semi-infinite optimization under convex function perturbations: Lipschitz stability (Q535062) (← links)
- An extension of the Fermat-Torricelli problem (Q613587) (← links)
- (Robust) edge-based semidefinite programming relaxation of sensor network localization (Q652286) (← links)
- A class of linearized proximal alternating direction methods (Q658552) (← links)
- Design approximation problems for linear-phase nonrecursive digital filters (Q696890) (← links)
- On approximating complex quadratic optimization problems via semidefinite programming relaxations (Q877200) (← links)
- A note on the regularization of discrete approximation problems (Q921320) (← links)
- Smoothing by mollifiers. I: Semi-infinite optimization (Q934789) (← links)
- An affine-scaling interior-point CBB method for box-constrained optimization (Q1013965) (← links)
- Optimality conditions for an isolated minimum of order two in \(C1\) constrained optimization (Q1022996) (← links)
- Hybrid methods for a class of monotone variational inequalities (Q1026064) (← links)
- (Q1151238) (redirect page) (← links)
- On level sets and an approximation problem for the numerical solution of a free boundary problem (Q1151239) (← links)
- An approximation technique for the numerical solution of a Stefan problem (Q1153664) (← links)
- Characterizations of local best Chebyshev approximations (Q1160840) (← links)
- On the convergence of a class of nonlinear approximation methods (Q1169786) (← links)
- A cutting plane method for solving minimax problems in the complex plane (Q1200545) (← links)
- A globally most violated cutting plane method for complex minimax problems with application to digital filter design (Q1315252) (← links)
- Discretization methods for the solution of semi-infinite programming problems (Q1321097) (← links)
- Some outer approximation methods for semi-infinite optimization problems (Q1343650) (← links)
- The design of FIR filters in the complex plane by convex optimization (Q1350308) (← links)
- Arcwise connected cone-convex functions and mathematical programming (Q1422861) (← links)
- Epsilon-proximal decomposition method (Q1424289) (← links)
- Continuity of the optimal value function in indefinite quadratic programming (Q1598885) (← links)
- On discretization errors in nonlinear approximation problems (Q1819301) (← links)
- Bicriterial design of digital filters (Q1863874) (← links)
- Numerical solution of optimal control problems with discrete-valued system parameters (Q1864786) (← links)
- Indefinite quadratic integer bilevel programming problem with bounded variables (Q1956480) (← links)
- Methods of embedding-cutting off in problems of mathematical programming (Q1959250) (← links)
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties (Q1960196) (← links)
- Strong Abadie CQ, ACQ, calmness and linear regularity (Q2248746) (← links)
- On Hazan's algorithm for symmetric programming problems (Q2342137) (← links)
- On the existence of a saddle value (Q2349839) (← links)
- Generalized invexity of nonsmooth functions (Q2378838) (← links)
- On convergence of augmented Lagrangian method for inverse semi-definite quadratic programming problems (Q2379780) (← links)
- First-order optimality conditions for convex semi-infinite min-max programming with noncompact sets (Q2379825) (← links)
- Conjugate duality and the control of linear discrete systems (Q2442704) (← links)
- Conjugate duality for multiobjective composed optimization problems (Q2460678) (← links)
- Computing minimum-volume enclosing axis-aligned ellipsoids (Q2481119) (← links)
- The trust region subproblem with non-intersecting linear constraints (Q2515041) (← links)
- Selected applications of convex optimization (Q2515153) (← links)
