Pages that link to "Item:Q2500511"

The following pages link to Optimization theory and methods. Nonlinear programming (Q2500511):

Displaying 50 items.

• A Dai-Liao-type projection method for monotone nonlinear equations and signal processing (Q2677334) (← links)
• A trust region method for solving multicriteria optimization problems on Riemannian manifolds (Q2679565) (← links)
• An exact penalty approach for optimization with nonnegative orthogonality constraints (Q2687065) (← links)
• A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem (Q2688917) (← links)
• A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula (Q2691372) (← links)
• Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications (Q2694483) (← links)
• An augmented Lagrangian approach with general constraints to solve nonlinear models of the large-scale reliable inventory systems (Q2698008) (← links)
• Linearly structured quadratic model updating using partial incomplete eigendata (Q2698192) (← links)
• Memory gradient method for multiobjective optimization (Q2700431) (← links)
• Practical methods of optimization. (Q2771952) (← links)
• A new fractional Chebyshev FDM: an application for solving the fractional differential equations generated by optimisation problem (Q2792195) (← links)
• Fast finite difference approximation for identifying parameters in a two-dimensional space-fractional nonlocal model with variable diffusivity coefficients (Q2796854) (← links)
• On convergence rates of linearized proximal algorithms for convex composite optimization with applications (Q2810547) (← links)
• A descent hybrid modification of the Polak-Ribière-Polyak conjugate gradient method (Q2826665) (← links)
• A New Adaptive Conjugate Gradient Algorithm for Large-Scale Unconstrained Optimization (Q2957702) (← links)
• AN ADAPTIVE CONJUGACY CONDITION AND RELATED NONLINEAR CONJUGATE GRADIENT METHODS (Q2971928) (← links)
• Computer Algebra and Line Search (Q3086910) (← links)
• The modified Levenberg-Marquardt method for nonlinear equations with cubic convergence (Q3117218) (← links)
• NEW ADAPTIVE BARZILAI–BORWEIN STEP SIZE AND ITS APPLICATION IN SOLVING LARGE-SCALE OPTIMIZATION PROBLEMS (Q3122031) (← links)
• The <i>d</i>-Level Nested Logit Model: Assortment and Price Optimization Problems (Q3453331) (← links)
• Two optimal Dai–Liao conjugate gradient methods (Q3453402) (← links)
• The Action Gambler and Equal-Sized Wagering (Q3621146) (← links)
• (Q4000274) (← links)
• (Q4303546) (← links)
• (Q4331736) (← links)
• (Q4451011) (← links)
• Minimizing a Symmetric Quasiconvex Function on a Two-Dimensional Lattice (Q4558294) (← links)
• The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning (Q4594176) (← links)
• A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints (Q4603042) (← links)
• Optimal Control, Dichotomy, and Closed Range (Q4604634) (← links)
• Feasible robust estimator in restricted semiparametric regression models based on the LTS approach (Q4607388) (← links)
• An adaptive nonmonotone trust region algorithm (Q4622885) (← links)
• A New Dai-Liao Conjugate Gradient Method with Optimal Parameter Choice (Q4632353) (← links)
• Low rank updates in preconditioning the saddle point systems arising from data assimilation problems (Q4638911) (← links)
• Convergence analysis of simplified iteratively regularized Gauss–Newton method in a Banach space setting (Q4689883) (← links)
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization (Q4911905) (← links)
• MATRIX ANALYSES ON THE DAI–LIAO CONJUGATE GRADIENT METHOD (Q4966642) (← links)
• On solving a class of linear semi-infinite programming by SDP method (Q4981874) (← links)
• MIN-MAX SOLUTIONS FOR PARAMETRIC CONTINUOUS STATIC GAME UNDER ROUGHNESS (PARAMETERS IN THE COST FUNCTION AND FEASIBLE REGION IS A ROUGH SET) (Q4986286) (← links)
• Recovery of a Time-Dependent Bottom Topography Function from the Shallow Water Equations via an Adjoint Approach (Q5010241) (← links)
• Exact Penalty Function for $\ell_{2,1}$ Norm Minimization over the Stiefel Manifold (Q5020849) (← links)
• A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization (Q5028578) (← links)
• Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization (Q5028623) (← links)
• Correction of trust region method with a new modified Newton method (Q5030542) (← links)
• A hybrid scaling parameter for the scaled memoryless BFGS method based on the ℓ_∞ matrix norm (Q5031718) (← links)
• Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization (Q5043843) (← links)
• A three-dimensional discrete model for approximating the deformation of a viral capsid subjected to lying over a flat surface in the static and time-dependent case (Q5049159) (← links)
• A class of smooth exact penalty function methods for optimization problems with orthogonality constraints (Q5058369) (← links)
• Improved high-dimensional regression models with matrix approximations applied to the comparative case studies with support vector machines (Q5058399) (← links)
• A new trust region–sequential quadratic programming approach for nonlinear systems based on nonlinear model predictive control (Q5059172) (← links)