Nonlinear transformations for the simplification of unconstrained nonlinear optimization problems
DOI10.1007/s10100-013-0310-yzbMath1339.90010OpenAlexW2035443292MaRDI QIDQ301110
Elvira Antal, Tibor Csendes, János Virágh
Publication date: 29 June 2016
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-013-0310-y
Symbolic computation and algebraic computation (68W30) Nonconvex programming, global optimization (90C26) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A simplified implementation of the least squares solution for pairwise comparisons matrices
- Nonlinear coordinate transformations for unconstrained optimization. II: Theoretical background
- Advanced preprocessing techniques for linear and quadratic programming
- Nonlinear coordinate transformations for unconstrained optimization. I: Basic transformations
- Interval Arithmetic in Maple with intpakX
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Symbolic optimization of algebraic functions
- Numerical Software with Result Verification
- The Reformulation-Optimization Software Engine
This page was built for publication: Nonlinear transformations for the simplification of unconstrained nonlinear optimization problems