Pages that link to "Item:Q4051917"
From MaRDI portal
The following pages link to Newton-type methods for unconstrained and linearly constrained optimization (Q4051917):
Displaying 50 items.
- Finding second-order stationary points in constrained minimization: a feasible direction approach (Q2194125) (← links)
- The order-restricted association model: two estimation algorithms and issues in testing (Q2260017) (← links)
- A class on nonmonotone stabilization methods in unconstrained optimization (Q2277146) (← links)
- Parallel proximal method of solving split system of fixed point set constraint minimization problems (Q2293112) (← links)
- Incremental multiple hidden layers regularized extreme learning machine based on forced positive-definite Cholesky factorization (Q2298694) (← links)
- First-order methods almost always avoid strict saddle points (Q2425175) (← links)
- Nonconvex optimization using negative curvature within a modified linesearch (Q2482748) (← links)
- A method of optimal scaling for multivariate ordinal data and its extensions (Q2639531) (← links)
- Adaptive step size selection for Hessian-based manifold Langevin samplers (Q2821480) (← links)
- (Q3057247) (← links)
- Second order algorithms for the posynomial geometric programming dual, part I: Analysis (Q3205030) (← links)
- A quadratically convergent method for minimizing a sum of euclidean norms (Q3321365) (← links)
- Optimization of unconstrained functions with sparse hessian matrices-newton-type methods (Q3324531) (← links)
- A note on the computation of an orthonormal basis for the null space of a matrix (Q3326727) (← links)
- Optimization over the efficient set using an active constraint approach (Q3363070) (← links)
- (Q3552458) (← links)
- Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel (Q3604758) (← links)
- (Q3660803) (← links)
- Linearly constrained pseudo-Newton method (Q3669188) (← links)
- Procedures for optimization problems with a mixture of bounds and general linear constraints (Q3675917) (← links)
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization (Q3698656) (← links)
- A hybrid algorithm for solving convex separable network flow problems (Q3706799) (← links)
- (Q3725888) (← links)
- Avoiding Modified Matrix Factorizations in Newton-like Methods (Q3802526) (← links)
- Numerical algorithms for solving nonlinear<i>L</i><sub>р</sub>-norm estimation problems: part II - a mixture method for large residual and illo-conditioned problems (Q3806604) (← links)
- The computation of Lagrange-multiplier estimates for constrained minimization (Q3858049) (← links)
- Optimal simultaneous maximum<i>a posteriori</i>estimation of states, noise statistics and parameters I. Algorithm (Q3895369) (← links)
- Optimal simultaneous maximum<i>a posteriori</i>estimation of states, noise statistics and parameters II. Numerical performance (Q3895370) (← links)
- A discrete Newton algorithm for minimizing a function of many variables (Q3934149) (← links)
- Nonlinear programming via an exact penalty function: Global analysis (Q3967372) (← links)
- Nonlinear programming via an exact penalty function: Asymptotic analysis (Q3967373) (← links)
- A quadratic programming algorithm for large and sparse problems (Q3978055) (← links)
- Insights into the interior-point methods (Q4009794) (← links)
- A superlinearly convergent algorithm for minimization without evaluating derivatives (Q4093226) (← links)
- A comparison of some algorithms for the nonlinear least squares problem (Q4127900) (← links)
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems (Q4139993) (← links)
- A modification of Armijo's step-size rule for negative curvature (Q4145437) (← links)
- Numerically stable methods for quadratic programming (Q4152038) (← links)
- Large-scale linearly constrained optimization (Q4162963) (← links)
- Generating conjugate directions without line searches using factorized variable metric updating formulas (Q4177352) (← links)
- On the use of directions of negative curvature in a modified newton method (Q4177356) (← links)
- Some simplified algorithms for the bayesian identification of aircraft parameters (Q4180253) (← links)
- A computational study of active set strategies in nonlinear programming with linear constraints (Q4187599) (← links)
- (Q4338425) (← links)
- (Q4338426) (← links)
- Some algorithms for the convex quadratic programming problem via the ABS approacxh (Q4380565) (← links)
- Modélisation géométrique de la faisabilité de plusieurs mélanges (Q4694994) (← links)
- Analysis of preconditioners for conjugate gradients through distribution of eigenvalues (Q4876384) (← links)
- Indefinitely preconditioned inexact Newton method for large sparse equality constrained nonlinear programming problems. (Q4940821) (← links)
- A new adaptive GMRES algorithm for achieving high accuracy (Q4940823) (← links)