Pages that link to "Item:Q3211127"
From MaRDI portal
The following pages link to Curved search methods for unconstrained optimization (Q3211127):
Displaying 12 items.
- A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem (Q1342076) (← links)
- Frame-based ray search algorithms in unconstrained optimization (Q1411465) (← links)
- Implementation of an inexact approach to solving linear semi-infinite programming problems (Q1903653) (← links)
- An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints (Q1923627) (← links)
- A hybrid-line-and-curve search globalization technique for inexact Newton methods (Q2073945) (← links)
- Smoothed penalty algorithms for optimization of nonlinear models (Q2643624) (← links)
- A multi-step curve search algorithm in nonlinear optimization (Q3649279) (← links)
- An unconstrained convex programming approach to solving convex quadratic programming problems (Q3835665) (← links)
- Convergence of multi-step curve search method for unconstrained optimization (Q4659957) (← links)
- A variant of curved search method (Q4764847) (← links)
- An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions (Q4859453) (← links)
- Linear programming with entropic perturbation (Q5286755) (← links)
