The following pages link to (Q5588268):
Displaying 50 items.
- Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions (Q2569198) (← links)
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936) (← links)
- Perturbed variations of penalty function methods. Example: Projective SUMT (Q2639773) (← links)
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems (Q2640436) (← links)
- Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization (Q2643614) (← links)
- Applications of one-shot methods in PDEs constrained shape optimization (Q2654365) (← links)
- An engineering interpretation of Nesterov's convex minimization algorithm and time integration: application to optimal fiber orientation (Q2666090) (← links)
- A comparison of optimization solvers for log binomial regression including conic programming (Q2666995) (← links)
- A function approximation approach for parametric optimization (Q2679557) (← links)
- A novel approach for solving multi-parametric problems with nonlinear constraints (Q2687438) (← links)
- The method of quasi-solutions based on barrier functions in the analysis of improper convex programs (Q2692754) (← links)
- A new fractional Chebyshev FDM: an application for solving the fractional differential equations generated by optimisation problem (Q2792195) (← links)
- Augmented Lagrangian Objective Penalty Function (Q2795100) (← links)
- On strong and weak second-order necessary optimality conditions for nonlinear programming (Q2817241) (← links)
- Shape Optimization for Free Boundary Problems – Analysis and Numerics (Q2961070) (← links)
- Generalized (F,β,Φ,ρ,θ) -univex functions and optimality conditions in semiinfinite fractional programming (Q3008571) (← links)
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method (Q3026741) (← links)
- Parameter estimation in multiple linear regression with fuzzy inequality constraints (Q3033144) (← links)
- Complexity of some inverse shortest path lengths problems (Q3057164) (← links)
- CONVERGENCE RATE OF THE SUCCESSIVE ZOOMING GENETIC ALGORITHM FOR BAND-WIDTHS OF EQUALITY CONSTRAINT (Q3062764) (← links)
- Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods (Q3089761) (← links)
- Inverse, Shifted Inverse, and Rayleigh Quotient Iteration as Newton's Method (Q3133142) (← links)
- An Elimination Type Two-Stage Procedure for Selecting the Population with the Largest Mean from<i>k</i>Logistic Populations (Q3136533) (← links)
- Stability of the solution of definite quadratic programs (Q3212923) (← links)
- Continuous limits for constrained ensemble Kalman filter (Q3298401) (← links)
- Characterization of Positive Definite and Semide Finite Matrices via Quadratic Programming Duality (Q3321843) (← links)
- Convergence rate for regularized arrier function methods (Q3360007) (← links)
- Integral global minimization of constrained problems with discontinuous penalty functions (Q3368126) (← links)
- (Q3407543) (← links)
- Strict quasi-concavity and the differential barrier property of gauges in linear programming (Q3453425) (← links)
- Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems (Q3465241) (← links)
- Karmarkar's projective method for linear programming: a computational survey (Q3491310) (← links)
- Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
- An interior-point algorithm for elastoplasticity (Q3587745) (← links)
- Application of the interior‐point method to shakedown analysis of pavements (Q3590374) (← links)
- Lipschitz modulus in convex semi-infinite optimization<i>via</i>d.c. functions (Q3643500) (← links)
- Marginal values and second-order necessary conditions for optimality (Q3669192) (← links)
- The decomposition optimization of complex systems (Q3674459) (← links)
- On uniqueness of Kuhn-Tucker multipliers in nonlinear programming (Q3682264) (← links)
- A non-linear programming approach to the computer-aided design of regulators using a linear-quadratic formulation† (Q3683985) (← links)
- A hadamard-stable extension of courant's sequential method for convex extremal problems (Q3697680) (← links)
- Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs (Q3703671) (← links)
- Distribution sensitivity analysis for stochastic programs with complete recourse (Q3713865) (← links)
- The principle of virtual work and its dual for contact problems (Q3727551) (← links)
- An exact penalty function method with global convergence properties for nonlinear programming problems (Q3768690) (← links)
- Some NP-complete problems in quadratic and nonlinear programming (Q3778558) (← links)
- Estimates for Kuhn-Tucker points of perturbed convex programs (Q3810435) (← links)
- Minimum problems on differentiable manifolds (Q3824117) (← links)
- An exact penalty-lagrangian approach for a class of constrained optimization problems with bounded variables (Q3835628) (← links)
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications (Q3851986) (← links)
