The following pages link to Anthony V. Fiacco (Q796449):
Displaying 36 items.
- (Q762064) (redirect page) (← links)
- Convexity and concavity properties of the optimal value function in parametric nonlinear programming (Q762065) (← links)
- Introduction to sensitivity and stability analysis in nonlinear programming (Q796451) (← links)
- Global multi-parametric optimal value bounds and solution estimates for separable parametric programs (Q804476) (← links)
- Computable bounds on parametric solutions of convex problems (Q1106102) (← links)
- Degeneracy in NLP and the development of results motivated by its presence (Q1312750) (← links)
- Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems (Q2276890) (← links)
- Penalty methods for mathematical programming in \(E^n\) with general constraint sets (Q2537022) (← links)
- Convergence properties of local solutions of sequences of mathematical programming problems in general spaces (Q2558831) (← links)
- Perturbed variations of penalty function methods. Example: Projective SUMT (Q2639773) (← links)
- Sensitivity and stability analysis for nonlinear programming (Q2639776) (← links)
- (Q3670923) (← links)
- (Q3691439) (← links)
- Generalized convexity and concavity of the optimal value function in nonlinear programming (Q3786289) (← links)
- (Q3861173) (← links)
- (Q3879067) (← links)
- (Q3883934) (← links)
- (Q3932564) (← links)
- (Q3959021) (← links)
- (Q3996571) (← links)
- Sensitivity analysis for nonlinear programming using penalty methods (Q4133431) (← links)
- On the stability of general convex programs under slater’s condition and primal solution boundedness (Q4764601) (← links)
- Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993 (Q4764602) (← links)
- Extensions of algorithmic senstivity calculations nonlinear programming using barrier and penalty functions (Q4764603) (← links)
- Neural networks using a logistics sigmoid function: linear classifier bounds and global nonattainability (Q4764604) (← links)
- Computational experience in sensitivity analysis for nonlinear programming (Q4770792) (← links)
- Objective function and logarithmic barrier function properties in convex programming: level sets, solution attainment and strict convexity<sup>*</sup> (Q4888269) (← links)
- Extensions of SUMT for Nonlinear Programming: Equality Constraints and Extrapolation (Q5516542) (← links)
- Second Order Sufficient Conditions for Weak and Strict Constrained Minima (Q5540118) (← links)
- The Sequential Unconstrained Minimization Technique (SUMT) Without Parameters (Q5557611) (← links)
- The Slacked Unconstrained Minimization Technique for Convex Programming (Q5574524) (← links)
- Generalized Penalty Methods in Topological Spaces (Q5576126) (← links)
- (Q5588268) (← links)
- A General Regularized Sequential Unconstrained Minimization Technique (Q5609002) (← links)
- (Q5623522) (← links)
- (Q5650216) (← links)
